Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN