index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

107

Publications récentes

 

 

Cartographie des collaborations du LISN