Author:
Dietzfelbinger Martin,Hagerup Torben
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Z. J. Czech, G. Havas, and B. S. Majewski, An optimal algorithm for generating minimal perfect hash functions, Inform. Process. Lett.
43 (1992), pp. 257–264.
2. Z. J. Czech, G. Havas, and B. S. Majewski, Perfect hashing, Theoret. Comput. Sci.
182 (1997), pp. 1–143.
3. Lect Notes Comput Sci;M. Dietzfelbinger,1992
4. E. A. Fox, L. S. Heath, Q. F. Chen, and A. M. Daoud, Practical minimal perfect hash functions for large databases, Comm. Assoc. Comput. Mach.
35 (1992), pp. 105–121.
5. 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.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maintaining External Memory Efficient Hash Tables;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2006
2. A Practical Minimal Perfect Hashing Method;Experimental and Efficient Algorithms;2005
3. Space Efficient Hash Tables with Worst Case Constant Access Time;Lecture Notes in Computer Science;2003
4. Design Strategies for Minimal Perfect Hash Functions;Stochastic Algorithms: Foundations and Applications
5. Simple and Space-Efficient Minimal Perfect Hash Functions;Lecture Notes in Computer Science