Efficient randomized dictionary matching algorithms
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 262-275
- https://doi.org/10.1007/3-540-56024-6_21
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Towards a theory of nearly constant time parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Polynomial hash functions are reliablePublished by Springer Nature ,1992
- Fast and reliable parallel hashingPublished by Association for Computing Machinery (ACM) ,1991
- An optimal parallel dictionaryPublished by Association for Computing Machinery (ACM) ,1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975
- Sur les assemblages de lignes.Journal für die reine und angewandte Mathematik (Crelles Journal), 1869