Optimal two-dimensional compressed matching
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 215-226
- https://doi.org/10.1007/3-540-58201-0_70
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Optimal parallel pattern matching in stringsPublished by Springer Nature ,2005
- Efficient two-dimensional compressed matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal parallel two dimensional pattern matchingPublished by Association for Computing Machinery (ACM) ,1993
- Alphabet independent two dimensional matchingPublished by Association for Computing Machinery (ACM) ,1992
- Truly alphabet-independent two-dimensional pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- An Optimal $O(\log\log n)$ Time Parallel String Matching AlgorithmSIAM Journal on Computing, 1990
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977