Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Approximate string matching: a simpler faster algorithm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
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)
Maintaining dense sequential files in a dynamic environment (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Data Structures for Maintaining Set Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Generalization of a Suffix Tree for RNA Structural Pattern Matching
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Ancestor Problems on Pure Pointer Machines
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A graphical presentation of MLF types with a linear-time unification algorithm
TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Retrieving meaningful relaxed tightest fragments for XML keyword search
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
O(n2 log n) time on-line construction of two-dimensional suffix trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
An optimal data structure to handle dynamic environments in non-deterministic computations
Computer Languages, Systems and Structures
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Theory of Computing Systems
| Hi-index | 0.00 |