index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN