Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN