Mots-clés

Compilation Machine learning Domain-specific language HPC Mixed precision algorithms C++ Randomization FOS Computer and information sciences Fault tolerance Population protocols GPU Quantum computation Dynamic networks Search Networks Système complexe Quantum computing Generative programming Asymptotic consensus Deterministic algorithms Parallel computing Graphics processing units Oblivious message adversaries SIMD Quantum Computing Applications Exact space complexity Graph algorithms Randomized algorithms FMI standard Statistical condition estimation Global and weak fairness Programmation générique Costs Interference control Mobile Agents Treasure Hunt Tucker decomposition SIMD extension Performance Linear reversible circuits Gathering High-performance computing Theory of computation → Distributed algorithms Clock synchronization Parallel skeletons B7 Connected component analysis Mobile agents Qubit Time complexity Deep Learning LSCR Exploration Interval analysis Wireless networks Spectral clustering Topology Linear systems Condition number Deterministic naming Distributed algorithms Parallel code optimization MAGMA library Combinatorial topology B0 Scheduling Optimization GPU computing Distributed Algorithms Pheromone Evaporation Iterative refinement Linear least squares High performance computing Tight lower bounds Leader election Beeping model Generic programming Distributed graph algorithms Approximation Approximate consensus Crash failures Lower bounds Low-rank approximations Compiler Optimization Hardware Architecture csAR Networks of passively mobile agents Partial diagonalization CP decomposition LU factorization Emerging Technologies csET Programmation générative Self-stabilization Consensus Calcul haute performance Navier-Stokes equations Register Allocation Benchmark Tensor computations Localization

 

Références bibliographiques

76

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN