Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN