Loading...
Mots-clés
Networks
Networks of passively mobile agents
Dynamic networks
Wireless networks
Spectral clustering
Tight lower bounds
Linear least squares
Connected component analysis
Randomized algorithms
Self-stabilization
ARMS
Agile research and development
Linear systems
Algorithmes randomisés
Beeping model
Linear reversible circuits
Theory of computation → Distributed algorithms
ADI method
Costs
Treasure Hunt
Emerging Technologies csET
65Y10
Algorithmes distribués
B0
Deterministic naming
Qubit
Mobile Agents
MAGMA library
Global and weak fairness
LSCR
Search
Hardware Architecture csAR
Graph algorithms
SIMD extension
Exploration
Condition number
Oblivious message adversaries
Statistical condition estimation
Exact space complexity
Accelerator
Mobile agents
Low-rank approximations
Performance
Approximation
Interference control
Localization
Generative programming
Parallel computing
ADI
Wireless sensor network
Calcul haute performance
Asymptotic consensus
Leader election
Analyse d'erreur inverse
GPU
Evaporation
Navier-Stokes equations
HPC
Machine learning
FOS Computer and information sciences
65Y05
Randomization
Benchmark
Access pattern detection
Interval analysis
SIMD
Approximate consensus
65F45
GPU computing
B7
LU factorization
Parallel skeletons
Clock synchronization
Time complexity
Pheromone
Gathering
Parallel code optimization
Graphics processing units
Distributed Algorithms
Quantum computation
FMI standard
Consensus
Tucker decomposition
Quantum computing
Scheduling
Deterministic algorithms
C++
Mixed precision algorithms
Population protocols
High-performance computing
Lower bounds
Iterative refinement
65F55
Algorithmique distribuée
Algorithme des k-Moyennes
Generic programming
Partial diagonalization
Système complexe
CP decomposition
Distributed algorithms
Références bibliographiques
76
Dépôts avec texte intégral
103
Publications récentes