Balls into Bins via Local Search: Cover Time and Maximum Load

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

doi:10.4230/LIPIcs.STACS.2014.187

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Balls into Bins via Local Search: Cover Time and Maximum Load

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45576

Sun, He
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2014/4457
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Sauerwald, T., Stauffer, A., & Sun, H. (2014). Balls into Bins via Local Search: Cover Time and Maximum Load. In E. W. Mayr, & N. Portier (Eds.), 31st International Symposium on Theoretical Aspects of Computer Science (pp. 187-198). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.STACS.2014.187.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0019-83F9-A

Abstract

There is no abstract available