index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN