Balanced allocation and dictionaries with tightly packed constant size bins

Theoretical Computer Science

Volumn 380, Issue 1-2, 2007, Pages 47-68

  Dietzfelbinger, Martin ^a   Weidling, Christoph ^b  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b Altova GmbH   (Austria)

Author keywords

Balanced allocation; Data structures; Dictionaries; Hashing; Random graphs; Randomized algorithms; Storage space

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; GRAPH THEORY; PROBLEM SOLVING;

BALANCED ALLOCATION; HASHING; RANDOM GRAPHS; RANDOMIZED ALGORITHMS; STORAGE SPACE;

STORAGE ALLOCATION (COMPUTER);

EID: 34248592076     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.054     Document Type: Article

References (27)

1. Azar Y., Broder A.Z., Karlin A.R., and Upfal E. Balanced allocations. SIAM J. Comput. 29 (2000) 180-200
2. Berenbrink P., Czumaj A., Steger A., and Vöcking B. Balanced allocations: The heavily loaded case. 32nd STOC (2000), ACM 745-754
3. Bollobas B. Random Graphs. 2nd edition (2001), Cambridge University Press
4. Czumaj A., Meyer auf der Heide F., and Stemann V. Contention resolution in hashing based shared memory simulations. SIAM J. Comput. 29 (2000) 1703-1739
5. Czumaj A., Riley Ch., and Scheideler Ch. Perfectly balanced allocation. RANDOM-APPROX. LNCS vol. 2764 (2003), Springer 240-251
6. Diestel R. Graph Theory (1997), Springer, New York
7. M. Dietzfelbinger, Applications of a splitting trick, 2007, in preparation
8. Dietzfelbinger M., and Meyer auf der Heide F. Dynamic hashing in real time. In: Buchmann J., et al. (Ed). Informatik-Festschrift zum 60. Geburtstag von Günter Hotz (1992), B. G. Teubner 95-119
9. Dietzfelbinger M., and Woelfel P. Almost random graphs with simple hash functions. 35th STOC (2003), ACM 629-638
10. Fotakis D., Pagh R., Sanders P., and Spirakis P. Space efficient hash tables with worst case constant access time. Theory of Computing Systems 38 (2005) 229-248
11. A. Frieze, Personal communication in [1], 1990
12. Frigo M., Leiserson C.E., Prokop H., and Ramachandran S. Cache-oblivious algorithms. 40th FOCS (1999), IEEE 285-298
13. Hagerup T., and Rüb Ch. A guided tour of Chernoff bounds. Inform. Process. Lett. 33 (1990) 305-308
14. Karp R. Random graphs, random walks, differential equations and the probabilistic analysis of algorithms. 15th STACS. LNCS vol. 1373 (1998), Springer 1-2
15. Karp R., Luby M., and Meyer auf der Heide F. Efficient PRAM simulations on a distributed memory machine. Algorithmica 16 (1996) 517-542
16. Mitzenmacher M., Richa A.W., and Sitaraman R. The power of two random choices: A survey of techniques and results. In: Rajasekaran S., et al. (Ed). Handbook of Randomized Computing vol. 1 (2001), Kluwer Academic Press 255-312
17. Motwani R. Average-case analysis of algorithms for matchings and related problems. J. ACM 41 6 (1994) 1329-1356
18. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
19. Östlin A., and Pagh R. Uniform hashing in constant time and linear space. 35th STOC (2003), ACM 622-628
20. A. Ott, Experimenteller Vergleich einiger neuer Verfahren zur Konstruktion von dynamischen Wörterbüchern mit fixer Zugriffszeit (in German), Studienarbeit, Technische Universität Ilmenau, Fakultät IA, 2004
21. Pagh R., and Rodler F.F. Cuckoo hashing. J. Algorithms 51 (2004) 122-144
22. Panigrahy R. Efficient hashing with lookups in two memory accesses. 16th SODA (2005), ACM-SIAM 830-839
23. Sanders P. Algorithms for scalable storage servers. SOFSEM 2004. LNCS vol. 2932 (2004), Springer 82-101
24. Sanders P. Fast priority queues for cached memory. 1st Workshop ALENEX. LNCS vol. 1619 (1999), Springer 312-327
25. Sanders P. Reconciling simplicity and realism in parallel disk models. Parallel Data Intensive Algorithms and Applications. Parallel Computing 28 5 (2002) 705-723 (special issue)
26. Sanders P., Egner S., and Korst J. Fast concurrent access to parallel disks. Algorithmica 35 1 (2003) 21-55
27. Siegel A. On universal classes of extremely random constant-time hash functions. SIAM J. Comput. 33 (2004) 505-543