@inproceedings{78f95d1491de4b2ba544b76b151a8693,

title = "Neighborhood preserving hashing and approximate queries",

abstract = "Let D⊂Σn be a dictionary. We look for efficient data structures and algorithms to solve the approximate query problem: Given a query u ∈ Σn list all words v ∈ D that are close to u in Hamming distance. The problem reduces to the following combinatorial problem: hash the vertices of the n-dimensional hypercube into buckets so that (1) the c-neighborhood of each vertex is mapped into no more than k buckets; (2) no bucket is too large. Lower and upper bounds are given for the tradeoff between k and the size of the largest bucket. These results are used to derive bounds for the approximate query problem.",

author = "Danny Dolev and Yuval Harari and Nathan Linial and Noam Nisan and Michal Parnas",

year = "1994",

language = "American English",

isbn = "0898713293",

series = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",

publisher = "Publ by ACM",

pages = "251--259",

booktitle = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",

note = "Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms ; Conference date: 23-01-1994 Through 25-01-1994",

}