index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN