Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN