Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Improved deterministic parallel integer sorting
Information and Computation
Parallel hashing and integer sorting
Journal of Algorithms
An introduction to parallel algorithms
An introduction to parallel algorithms
Recursive star-tree parallel data structure
SIAM Journal on Computing
Maintaining dynamic sequences under equality-tests in polylogarithmic time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Optimal parallel suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Three-dimensional pattern matching
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Text Sparsification via Local Maxima
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Text sparsification via local maxima
Theoretical Computer Science
Random Structures & Algorithms
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
ESP-index: A compressed index based on edit-sensitive parsing
Journal of Discrete Algorithms
Brief announcement: truly parallel burrows-wheeler compression and decompression
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |