Pages that link to "Item:Q1327313"
From MaRDI portal
The following pages link to An algorithm for approximate membership checking with application to password security (Q1327313):
Displaying 11 items.
- Improved bounds for dictionary look-up with one error (Q294796) (← links)
- Simple, compact and robust approximate string dictionary (Q405575) (← links)
- Scalable Bloom filters (Q845946) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Revisiting multiple pattern matching algorithms for multi-core architecture (Q2434550) (← links)
- An Optimal Bloom Filter Replacement Based on Matrix Solving (Q3392960) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- (Q5111826) (← links)
- DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE (Q5696965) (← links)
