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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN