Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
Fast parallel and serial multidimensional approximate array matching
Theoretical Computer Science
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Digital Picture Processing
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Optimal parallel two dimensional pattern matching
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Multiple matching of rectangular patterns
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved dynamic dictionary matching
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Two and higher dimensional pattern matching in optimal expected time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On Fine and Wilf's theorem for bidimensional words
Theoretical Computer Science
An Index for Two Dimensional String Matching Allowing Rotations
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On a conjecture on bidimensional words
Theoretical Computer Science
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science
Searching for a set of correlated patterns
Journal of Discrete Algorithms
An indexing method for two-d pattern matching with applications to digital image searches
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
| Hi-index | 0.00 |