Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN