Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN