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

DOI10.1002/RSA.20602zbMATH Open1341.05237OpenAlexW3023534374MaRDI QIDQ5740271FDOQ5740271

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

Recommendations

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

zbMATH Keywords

local searchload balancingstochastic processballs-into-bins

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Concentration Inequalities and Martingale Inequalities: A Survey
• How asymmetry helps load balancing
• Balanced Allocations
• Probability and Computing
• Efficient PRAM simulation on a distributed memory machine
• Balanced Allocations: The Heavily Loaded Case

Cited In (4)

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

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)