index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN