Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Computational geometry: an introduction
Computational geometry: an introduction
Theoretical Computer Science
Obtaining lower bounds using artificial components
Information Processing Letters
SIAM Journal on Computing
Optimal and sublogarithmic time randomized parallel sorting algorithms
SIAM Journal on Computing
Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Optimal superprimitivity testing for strings
Information Processing Letters
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
Journal of the ACM (JACM)
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Fast parallel string prefix-matching
Fast parallel string prefix-matching
Finding all periods and initial palindromes of a string in parallel
Finding all periods and initial palindromes of a string in parallel
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
String pattern matching for a deluge survival kit
Handbook of massive data sets
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Algorithms for Computing the λ-regularities in Strings
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Discovering regularities in biosequences: Challenges and applications
Journal of Computational Methods in Sciences and Engineering
Computing the λ-seeds of a string
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Algorithms for Computing the λ-regularities in Strings
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
| Hi-index | 0.01 |