Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN