Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN