Non-expansive hashing

Combinatorica

Volumn 18, Issue 1, 1998, Pages 121-132

  Linial, Nathan ^a   Sasson, Ori ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032410192     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009805     Document Type: Article

References (9)

1. J. L. CARTER and M. N. WEGMAN,: Universal Classes of Hash Functions, Proceedings of the 9th ACM Symposium on Theory of Computing, 1977, 106-112.
2. M. DIETZFELBINGER, A. KARLIN, K. MEHLHORN, F. MEYER AUF DER HEIDE, H. ROHNERT and R. E. TARJAN: Dynamic Perfect Hashing: Upper and Lower Bounds, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, 524-531.
3. D. DOLEV, Y. HARARI, N. LINIAL, N. NISAN, and M. PARNAS: Neighborhood preserving hashing and approximate queries, 5th ACM Symposium on Discrete Algorithms, 1994.
4. D. DOLEV, Y. HARARI, and M. PARNAS: Finding the neighborhood of a query in a dictionary, 2nd Israeli Symposium on Theory of Computing and Systems.
5. M. L. FREDMAN, J. KOMLÓS, and E. SZEMERÉDI: Storing a Sparse Table with O(1) Worst Case Access Time, Journal of the ACM, Vol. 31, No. 3, July 1984, 538-544.
6. D. GREENE, M. PARNAS, and F. YAO: Multi-Index Hashing for Information Retrieval, Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science, 1994.
7. P. KANERVA: Sparse Distributed Memory, MIT Press, Cambridge, Massachusetts, 1988, 12.
8. M. MINSKY and S. PAPERT: Perceptrons, MIT Press, Cambridge, Massachusetts, 1969, 222-225.
9. M. PARNAS: Robust Algorithms and Data Structures for Information Retrieval, Ph. D. dissertation, Hebrew University, Jerusalem, Israel, 1994.