Balanced allocation through random walk
- 1 March 2018
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 131, 39-43
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- NSF (DMS0753472)
- National Science Foundation Graduate Research Fellowship (DGE-1650044)
This publication has 5 references indexed in Scilit:
- On the Insertion Time of Cuckoo HashingSIAM Journal on Computing, 2013
- An Analysis of Random-Walk Cuckoo HashingSIAM Journal on Computing, 2011
- Balanced allocation and dictionaries with tightly packed constant size binsTheoretical Computer Science, 2007
- Space Efficient Hash Tables with Worst Case Constant Access TimeTheory of Computing Systems, 2004
- Cuckoo hashingJournal of Algorithms, 2004