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

DOI10.1002/RSA.20602MaRDI QIDQ5740271zbMATH OpenOpenAlexFDO

Authors Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun

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 searchload balancingstochastic processballs-into-bins

Mathematics Subject Classification ID

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

Recommendations

• Balls into bins via local search: cover time and maximum load
• Balls into bins via local search
• Perfectly balanced allocation

Cites work

• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• Balanced Allocations
• Balanced Allocations: The Heavily Loaded Case
• Concentration Inequalities and Martingale Inequalities: A Survey
• Efficient PRAM simulation on a distributed memory machine
• How asymmetry helps load balancing
• Probability and Computing

Cited in

(4)

• A stochastic process on the hypercube with applications to peer-to-peer networks
• Balls into bins via local search
• Balls into bins via local search: cover time and maximum load
• Self-stabilizing repeated balls-into-bins

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740271)