Balls into non-uniform bins
From MaRDI portal
Publication:897392
DOI10.1016/j.jpdc.2013.10.008zbMath1327.68042OpenAlexW2045334063WikidataQ59202503 ScholiaQ59202503MaRDI QIDQ897392
Lars Nagel, Tom Friedetzky, André Brinkmann, Petra Berenbrink
Publication date: 18 December 2015
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/17874/1/17874.pdf
Applications of game theory (91A80) Distributed systems (68M14) Randomized algorithms (68W20) Combinatorial games (91A46)
Related Items (4)
New techniques and tighter bounds for local computation algorithms ⋮ Parallel load balancing on constrained client-server topologies ⋮ Stochastic coordination in heterogeneous load balancing systems ⋮ Long-term balanced allocation via thinning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balls into bins with related random choices
- Space efficient hash tables with worst case constant access time
- Balanced allocations (extended abstract)
- Distributed selfish load balancing with weights and speeds
- Balanced allocations
- Balanced allocation on graphs
This page was built for publication: Balls into non-uniform bins