Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Parallel construction and query of suffix trees for two-dimensional matrices
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
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first 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
On Fine and Wilf's theorem for bidimensional words
Theoretical Computer Science
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On a conjecture on bidimensional words
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Two-dimensional pattern matching with rotations
Theoretical Computer Science
Theoretical Computer Science
Two-dimensional pattern matching with rotations
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Small-space 2D compressed dictionary matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
A note on a tree-based 2D indexing
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hi-index | 0.90 |