| Publication | Date of Publication | Type |
|---|
Fully-online suffix tree and directed acyclic word graph construction for multiple texts
Algorithmica | 2020-04-01 | Paper |
Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Real-time streaming string-matching
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On competitive on-line paging with lookahead
STACS 96 | 2017-11-16 | Paper |
Transforming comparison model lower bounds to the parallel-random-access-machine
Information Processing Letters | 2016-05-26 | Paper |
Towards optimal packed string matching
Theoretical Computer Science | 2014-03-13 | Paper |
Simple real-time constant-space string matching
Theoretical Computer Science | 2014-01-09 | Paper |
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms | 2013-06-24 | Paper |
On suffix extensions in suffix trees
Theoretical Computer Science | 2012-10-11 | Paper |
| Optimal packed string matching | 2012-08-31 | Paper |
Constant-time word-size string matching
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Simple real-time constant-space string matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Real-time streaming string-matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
| scientific article; zbMATH DE number 1414294 (Why is no real title available?) | 2000-03-16 | Paper |
On the Comparison Complexity of the String Prefix-Matching Problem
Journal of Algorithms | 1999-05-18 | Paper |
On competitive on-line paging with lookahead
Theoretical Computer Science | 1999-02-02 | Paper |
The suffix tree of a tree and minimizing sequential transducers
Theoretical Computer Science | 1998-08-13 | Paper |
Rotations of Periodic Strings and Short Superstrings
Journal of Algorithms | 1997-10-20 | Paper |
Saving comparisons in the Crochemore-Perrin string-matching algorithm
Theoretical Computer Science | 1997-09-07 | Paper |
Efficient string matching on packed texts
RAIRO - Theoretical Informatics and Applications | 1997-07-27 | Paper |
Parallel detection of all palindromes in a string
Theoretical Computer Science | 1997-02-28 | Paper |
Fast parallel string prefix-matching
Theoretical Computer Science | 1997-02-28 | Paper |
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
SIAM Journal on Computing | 1997-02-24 | Paper |
Finding all periods and initial palindromes of a string in parallel
Algorithmica | 1996-03-11 | Paper |
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
Journal of Algorithms | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 826050 (Why is no real title available?) | 1995-12-13 | Paper |
Tight comparison bounds for the string prefix-matching problem
Information Processing Letters | 1994-12-11 | Paper |
Testing string superprimitivity in parallel
Information Processing Letters | 1994-04-05 | Paper |
Efficient comparison based string matching
Journal of Complexity | 1994-01-23 | Paper |
An on-line string superprimitivity test
Information Processing Letters | 1993-05-16 | Paper |
A Lower Bound for Parallel String Matching
SIAM Journal on Computing | 1992-12-06 | Paper |
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
SIAM Journal on Computing | 1990-01-01 | Paper |
