Balanced allocation and dictionaries with tightly packed constant size bins
- 1 June 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 380 (1-2) , 47-68
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Space Efficient Hash Tables with Worst Case Constant Access TimeTheory of Computing Systems, 2004
- Cuckoo hashingJournal of Algorithms, 2004
- On Universal Classes of Extremely Random Constant-Time Hash FunctionsSIAM Journal on Computing, 2004
- Fast Concurrent Access to Parallel DisksAlgorithmica, 2002
- Reconciling simplicity and realism in parallel disk modelsParallel Computing, 2002
- Contention Resolution in Hashing Based Shared Memory SimulationsSIAM Journal on Computing, 2000
- Balanced AllocationsSIAM Journal on Computing, 1999
- Efficient PRAM simulation on a distributed memory machineAlgorithmica, 1996
- Average-case analysis of algorithms for matchings and related problemsJournal of the ACM, 1994
- A guided tour of chernoff boundsInformation Processing Letters, 1990