Improved bounds for dictionary look-up with one error
From MaRDI portal
Publication:294796
DOI10.1016/S0020-0190(00)00079-XzbMATH Open1339.68050OpenAlexW2161245503MaRDI QIDQ294796FDOQ294796
Authors: Gerth Stølting Brodal, S. Venkatesh 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001900000079X?np=y
Recommendations
Cites Work
- Title not available (Why is that?)
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Universal hashing and \(k\)-wise independent random variables via integer arithmetic without primes
- Dictionary Look-Up with One Error
- Two results on tables
- An algorithm for approximate membership checking with application to password security
- Title not available (Why is that?)
- Should Tables Be Sorted?
Cited In (14)
- Fast entropy-bounded string dictionary look-up with mismatches
- Compressed string dictionary search with edit distance one
- DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE
- A Survey of Data Structures in the Bitprobe Model
- Fast string dictionary lookup with one error
- Index structures for fast similarity search for binary vectors
- Difference Covers
- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
- Faster and Space-Optimal Edit Distance “1” Dictionary
- Text indexing with errors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern masking for dictionary matching: theory and practice
- Dictionary Look-Up with One Error
This page was built for publication: Improved bounds for dictionary look-up with one error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294796)
