index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

Chargement de la page

Publications récentes

 

 

Cartographie des collaborations du LISN