Improved bounds for dictionary look-up with one error
From MaRDI portal
(Redirected from Publication:294796)
Recommendations
Cites work
- scientific article; zbMATH DE number 1003256 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- An algorithm for approximate membership checking with application to password security
- Dictionary Look-Up with One Error
- Should Tables Be Sorted?
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Two results on tables
- Universal hashing and \(k\)-wise independent random variables via integer arithmetic without primes
Cited in
(14)- Compressed string dictionary search with edit distance one
- Fast entropy-bounded string dictionary look-up with mismatches
- 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
- Text indexing with errors
- Faster and Space-Optimal Edit Distance “1” Dictionary
- scientific article; zbMATH DE number 2089967 (Why is no real title available?)
- scientific article; zbMATH DE number 2086642 (Why is no real title available?)
- 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)
