Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

116

Publications récentes

 

 

Cartographie des collaborations du LISN