Efficient minimal perfect hashing in nearly minimal space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 317-326

  Hagerup, Torben ^a   Tholey, Torsten ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Algorithms and data structures; Computational and structural complexity; Perfect hashing; Space complexity; Sparse tables

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMS AND DATA STRUCTURES; COMPUTATIONAL AND STRUCTURAL COMPLEXITY; PERFECT HASHING; SPACE COMPLEXITY; SPARSE TABLES;

HASH FUNCTIONS;

EID: 84957076793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_28     Document Type: Conference Paper

References (12)

1. J. L. Carter and M. N. Wegman, Universal Classes of Hash Functions, J. Comput. System Sci. 18 (1979), pp. 143-154.
2. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, Proc. 17th International Colloquium on Automata, Languages and Programming (ICALP 1990), Lecture Notes in Computer Science, Vol. 443, Springer-Verlag, Berlin, pp. 6-19.
3. M. L. Fredman and J. Komlós, On the size of separating systems and families of perfect hash functions, SIAM J. Alg. Disc. Meth. 5 (1984), pp. 61-68.
4. M. L. Fredman, J. Komlós and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. ACM 31 (1984), pp. 538-544.
5. T. Hagerup, Sorting and searching on the word RAM, Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science, Vol. 1373, Springer-Verlag, Berlin, pp. 366-398.
6. M. Hofri, Probabilistic Analysis of Algorithms, Springer-Verlag, New York, 1987.
7. C. P. Kruskal, L. Rudolph and M. Snir, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71, (1990), pp. 95-132.
8. K. Mehlhorn, Data Structures and Algorithms, Vol. 1: Sorting and Searching, Springer-Verlag, Berlin, 1984.
9. M. O. Rabin, Probabilistic algorithm for testing primality. J. Number Theory 12, (1980), pp. 128-138.
10. J. Radhakrishnan, Improved bounds for covering complete uniform hypergraphs, Inform. Process. Lett. 41 (1992), pp. 203-207.
11. J. P. Schmidt and A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM J. Comput. 19 (1990), pp. 775-786.
12. A. Siegel, On universal classes of fast high performance hash functions, their timespace tradeoff, and their applications, Proc. 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1989), pp. 20-25.