Approximate dictionary queries

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

Volumn 1075, Issue , 1996, Pages 65-74

  Brodal, Gerth Stølting ^a,b   Gasieniec, Leszek ^b,c  

^a AARHUS UNIVERSITY   (Denmark)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; DATA STRUCTURES; PATTERN MATCHING;

AMORTIZED TIME; BINARY STRING; QUERY STRING;

HAMMING DISTANCE;

EID: 84957700642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_6     Document Type: Conference Paper

References (15)

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.
2. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13:422-426, 1970.
3. Paul F. Dietz and Daniel D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th Ann. ACM Symp. on Theory of Computing (STOC), pages 365-372, 1987.
4. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, and Michael Pamas. Neighborhood preserving hashing and approximate queries. In Proc. 5th ACM- SIAM Symposium on Discrete Algorithms (SODA), pages 251-259, 1994.
5. Danny Dolev, Yuval Harari, and Michael Pamas. Finding the neighborhood of a query in a dictionary. In Proc. 2nd Israel Symposium on Theory of Computing and Systems, pages 33-42, 1993.
6. E. Fredkin. Trie memory. Communications of the ACM, 3:490-499, 1962.
7. Michael L. Fredman, Janós Komlós, and Ėndre Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, 1984.
8. Harold N. Gabow and Robert Endre Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30:209-221, 1985.
9. Dan Greene, Michal Pamas, and Frances Yao. Multi-index hashing for information retrieved. In Proc. 35th Ann. Symp. on Foundations of Computer Science (FOCS), pages 722-731, 1994.
10. Hiroshi Imai and Taka Asano. Dynamic orthogonal segment intersection search. Journal of Algorithms, 8:1-18, 1987.
11. Udi Manber and Sun Wu. An algorithm for approximate membership checking with application to password security. Information Processing Letters, 50:191-197, 1994.
12. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, Mass., 1969.
13. P. van Emde Boas. Machine models find simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. MIT Press/Elsevier, 1990.
14. Andrew C. Yao. Should tables be sorted? Journal of the ACM, 28(3):615-628, 1981.
15. Andrew C. Yao and Frances F. Yao. Dictionary look-up with small errors. In Proc. 6th Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 388-394. Springer Verlag, Berlin, 1995.