Chains-into-bins processes
From MaRDI portal
Publication:450541
DOI10.1016/J.JDA.2011.12.006zbMATH Open1247.68322OpenAlexW2168358943MaRDI QIDQ450541FDOQ450541
Authors: Tuğkan Batu, Petra Berenbrink, Colin Cooper
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.006
Recommendations
Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- How asymmetry helps load balancing
- Title not available (Why is that?)
- Balanced Allocations
- Balanced allocation on graphs
- Title not available (Why is that?)
- Tail Bounds and Expectations for Random Arc Allocation and Applications
- Balanced Allocations: The Heavily Loaded Case
Cited In (2)
This page was built for publication: Chains-into-bins processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450541)