Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN