Finding the neighborhood of a query in a dictionary
- 31 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- Dynamic perfect hashing: upper and lower boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Introducing efficient parallelism into approximate string matching and a new serial algorithmPublished by Association for Computing Machinery (ACM) ,1986
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- Efficient string matching in the presence of errorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- A survey of perfect codesRocky Mountain Journal of Mathematics, 1975
- Nearly perfect binary codesDiscrete Mathematics, 1972