Selected papers that cite this one
- N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16(4/5):434-449, October/November 1996.
Selected references
- M. Ajtai, M. Fredman, and J. Komlós. Hash functions for priority queues. In 24th Annual Symposium on Foundations of Computer Science, pages 299-303, Tucson, Arizona, 7-9 November 1983. IEEE.
- Pedro Celis, Per-Åke Larson, and J. Ian Munro. Robin Hood hashing (preliminary report). In 26th Annual Symposium on Foundations of Computer Science, pages 281-288, Portland, Oregon, 21-23 October 1985. IEEE.
- Amos Fiat and Moni Naor. Implicit O(1) probe search. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 336-344, Seattle, Washington, 15-17 May 1989.
- Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, and Alan Siegel. Storing and searching a multikey table (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 344-353, Chicago, Illinois, 2-4 May 1988.
- Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, July 1984.
- Gaston H. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the ACM, 28(2):289-304, April 1981.
- Harry G. Mairson. The program complexity of searching a table. In 24th Annual Symposium on Foundations of Computer Science, pages 40-47, Tucson, Arizona, 7-9 November 1983. IEEE.
- Kurt Mehlhorn. On the program size of perfect and universal hash functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 170-175, Chicago, Illinois, 3-5 November 1982. IEEE.
- J. Ian Munro. Searching a two key table under a single key. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 383-387, New York City, 25-27 May 1987.
- Ronald L. Rivest. Optimal arrangement of keys in a hash table. Journal of the ACM, 25(2):200-209, April 1978.
- Andrew Chi-Chih Yao. Should tables be sorted? Journal of the ACM, 28(3):615-628, July 1981.