Optimal Two-Dimensional Compressed Matching
- 31 August 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 24 (2) , 354-379
- https://doi.org/10.1006/jagm.1997.0860
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient two-dimensional compressed matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal two-dimensional compressed matchingPublished by Springer Nature ,1994
- An alphabet-independent optimal parallel search for three dimensional patternPublished by Springer Nature ,1994
- Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- 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