index - Systèmes Parallèles Accéder directement au contenu

Mots-clés

C++ Quantum computation Algorithmes randomisés Distributed Algorithms CP decomposition Wireless networks Hardware Architecture csAR Pheromone B0 MAGMA library Search Accelerator Dynamic networks Theory of computation → Distributed algorithms Linear least squares Navier-Stokes equations Algorithme des k-Moyennes Randomization Linear systems Iterative refinement Consensus FOS Computer and information sciences B7 Condition number SIMD extension Approximation Exploration Costs Analyse d'erreur inverse Graph algorithms FMI standard Oblivious message adversaries LU factorization Time complexity Deterministic naming Interference control 65Y10 Gathering Access pattern detection ADI method Linear reversible circuits Mixed precision algorithms Evaporation Leader election Interval analysis Networks of passively mobile agents Treasure Hunt LSCR Localization Parallel skeletons Scheduling Asymptotic consensus Parallel computing Tucker decomposition Mobile agents Generative programming GPU computing Emerging Technologies csET 65F55 Quantum computing Deterministic algorithms 65Y05 Partial diagonalization Population protocols Low-rank approximations High-performance computing Calcul haute performance SIMD Approximate consensus Benchmark Graphics processing units ARMS Spectral clustering Mobile Agents Lower bounds Generic programming Algorithmes distribués Randomized algorithms Distributed algorithms Global and weak fairness Agile research and development Clock synchronization Networks GPU Self-stabilization Exact space complexity Performance Connected component analysis Statistical condition estimation Beeping model Tight lower bounds 65F45 Wireless sensor network ADI Parallel code optimization Système complexe HPC Qubit Machine learning Algorithmique distribuée

 

Références bibliographiques

75

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN