Balls into bins via local search: Cover time and maximum load

DOI10.1002/rsa.20602zbMath1341.05237OpenAlexW3023534374MaRDI QIDQ5740271

Karl Bringmann, Thomas Sauerwald, He Sun, Alexandre Stauffer

Publication date: 25 July 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://opus.bath.ac.uk/44564/1/finalversion_rsa.pdf

zbMATH Keywords

local searchstochastic processload balancingballs-into-bins

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Efficient PRAM simulation on a distributed memory machine
• Concentration Inequalities and Martingale Inequalities: A Survey
• How asymmetry helps load balancing
• Balanced Allocations
• Probability and Computing
• Balanced Allocations: The Heavily Loaded Case

This page was built for publication: Balls into bins via local search: Cover time and maximum load