| Publication | Date of Publication | Type |
|---|
Practical KMP/BM style pattern-matching on indeterminate strings
Discrete Applied Mathematics | 2025-04-28 | Paper |
| \(V\)-words, Lyndon words and substring circ-UMFFs | 2024-09-16 | Paper |
String Covering: A Survey
Fundamenta Informaticae | 2024-02-02 | Paper |
Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order
Theoretical Computer Science | 2021-07-22 | Paper |
A new approach to regular \& indeterminate strings
Theoretical Computer Science | 2021-01-25 | Paper |
More properties of the Fibonacci word on an infinite alphabet
Theoretical Computer Science | 2019-10-18 | Paper |
More properties of the Fibonacci word on an infinite alphabet
Theoretical Computer Science | 2019-10-18 | Paper |
| Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index | 2019-10-15 | Paper |
Off-line and on-line algorithms for closed string factorization
Theoretical Computer Science | 2019-10-07 | Paper |
| Palindromes in starlike trees | 2019-05-23 | Paper |
Palindromes in starlike trees
(available as arXiv preprint) | 2019-05-23 | Paper |
Frequency covers for strings
Fundamenta Informaticae | 2019-01-17 | Paper |
String covering with optimal covers
Journal of Discrete Algorithms | 2019-01-04 | Paper |
Lyndon array construction during Burrows-Wheeler inversion
Journal of Discrete Algorithms | 2018-12-14 | Paper |
Lyndon array construction during Burrows-Wheeler inversion
Journal of Discrete Algorithms | 2018-12-14 | Paper |
Reconstructing a string from its Lyndon arrays
Theoretical Computer Science | 2018-02-16 | Paper |
Constructing an indeterminate string from its associated graph
Theoretical Computer Science | 2018-02-16 | Paper |
Counting Lyndon factors
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Counting Lyndon factors
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Enhanced covers of regular and indeterminate strings using prefix tables
(available as arXiv preprint) | 2017-06-13 | Paper |
A prefix array for parameterized strings
Journal of Discrete Algorithms | 2017-02-14 | Paper |
Large-scale detection of repetitions
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
\(V\)-order: new combinatorial properties \& a simple comparison algorithm
Discrete Applied Mathematics | 2016-10-07 | Paper |
Computing covers using prefix tables
Discrete Applied Mathematics | 2016-09-12 | Paper |
The new periodicity lemma revisited
Discrete Applied Mathematics | 2016-09-12 | Paper |
A note on easy and efficient computation of full abelian periods of a word
Discrete Applied Mathematics | 2016-09-12 | Paper |
Simple linear comparison of strings in V-order
Fundamenta Informaticae | 2016-05-11 | Paper |
Indeterminate strings, prefix arrays \& undirected graphs
Theoretical Computer Science | 2015-09-16 | Paper |
Fast and simple computations using prefix tables under Hamming and edit distance
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Three overlapping squares: the general case characterized \& applications
Theoretical Computer Science | 2015-07-24 | Paper |
Inferring an indeterminate string from a prefix graph
Journal of Discrete Algorithms | 2015-05-04 | Paper |
A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys | 2014-08-13 | Paper |
| Analyzing strings with ordered Lyndon-like structures | 2014-07-10 | Paper |
| Are three squares impossible? | 2014-07-10 | Paper |
A bijective variant of the Burrows-Wheeler transform using V-order
Theoretical Computer Science | 2014-03-28 | Paper |
Simple linear comparison of strings in V-order (extended abstract)
Algorithms and Computation | 2014-02-18 | Paper |
Prefix table construction and conversion
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Enhanced string covering
Theoretical Computer Science | 2014-01-16 | Paper |
A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
Theoretical Computer Science | 2014-01-09 | Paper |
More results on overlapping squares
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Generic Algorithms for Factoring Strings
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Computing regularities in strings: a survey
European Journal of Combinatorics | 2012-11-15 | Paper |
The three squares lemma revisited
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Minimum unique substrings and maximum repeats
Fundamenta Informaticae | 2011-11-22 | Paper |
String comparison and Lyndon-like factorization using V-order in linear time
Combinatorial Pattern Matching | 2011-06-29 | Paper |
New complexity results for the k-covers problem
Information Sciences | 2011-06-22 | Paper |
Fast, practical algorithms for computing all the repeats in a string
Mathematics in Computer Science | 2011-02-19 | Paper |
Combinatorics of unique maximal factorization families (UMFFs)
Fundamenta Informaticae | 2010-02-05 | Paper |
Faster algorithms for computing maximal multirepeats in multiple sequences
Fundamenta Informaticae | 2010-02-05 | Paper |
An adaptive hybrid pattern-matching algorithm on indeterminate strings
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
A new approach to the periodicity lemma on strings with holes
Theoretical Computer Science | 2009-10-09 | Paper |
Fast pattern-matching on indeterminate strings
Journal of Discrete Algorithms | 2008-11-18 | Paper |
IDENTIFYING RHYTHMS IN MUSICAL TEXTS
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
Lempel-Ziv factorization using less time \& space
Mathematics in Computer Science | 2008-09-08 | Paper |
How many runs can a string contain?
Theoretical Computer Science | 2008-07-31 | Paper |
Fast and Practical Algorithms for Computing All the Runs in a String
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms | 2008-05-29 | Paper |
Two-pattern strings. II: Frequency of occurrence and substring complexity
Journal of Discrete Algorithms | 2008-05-29 | Paper |
| The complexity of the minimum k-cover problem | 2008-03-06 | Paper |
Finding Patterns with Variable Length Gaps or Don’t Cares
Lecture Notes in Computer Science | 2007-09-10 | Paper |
A New Periodicity Lemma
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
RECONSTRUCTING A SUFFIX ARRAY
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
On optimum summable graphs
AKCE International Journal of Graphs and Combinatorics | 2006-10-12 | Paper |
SORTING SUFFIXES OF TWO-PATTERN STRINGS
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2185637 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2105038 (Why is no real title available?) | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2105037 (Why is no real title available?) | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2087045 (Why is no real title available?) | 2004-08-11 | Paper |
Two-pattern strings. I: A recognition algorithm
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2052918 (Why is no real title available?) | 2004-03-08 | Paper |
| scientific article; zbMATH DE number 2052916 (Why is no real title available?) | 2004-03-08 | Paper |
| scientific article; zbMATH DE number 1874382 (Why is no real title available?) | 2003-04-06 | Paper |
Computing the cover array in linear time
Algorithmica | 2002-10-23 | Paper |
Approximate periods of strings
Theoretical Computer Science | 2002-03-03 | Paper |
Repetitive perhaps, but certainly not boring
Theoretical Computer Science | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1279038 (Why is no real title available?) | 1999-05-26 | Paper |
| scientific article; zbMATH DE number 1186100 (Why is no real title available?) | 1998-12-02 | Paper |
| scientific article; zbMATH DE number 1123788 (Why is no real title available?) | 1998-08-31 | Paper |
| scientific article; zbMATH DE number 1052825 (Why is no real title available?) | 1998-02-04 | Paper |
| scientific article; zbMATH DE number 1092948 (Why is no real title available?) | 1997-12-02 | Paper |
COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH
International Journal of Foundations of Computer Science | 1997-01-27 | Paper |
A fast average case algorithm for lyndon decomposition
International Journal of Computer Mathematics | 1996-10-07 | Paper |
A family of sparse graphs of large sum number
Discrete Mathematics | 1995-11-27 | Paper |
| scientific article; zbMATH DE number 812046 (Why is no real title available?) | 1995-11-02 | Paper |
| scientific article; zbMATH DE number 812051 (Why is no real title available?) | 1995-11-02 | Paper |
Parallel RAM algorithms for factorizing words
Theoretical Computer Science | 1995-01-26 | Paper |
| scientific article; zbMATH DE number 426366 (Why is no real title available?) | 1994-07-12 | Paper |
| scientific article; zbMATH DE number 426164 (Why is no real title available?) | 1994-06-28 | Paper |
A fast and effective heuristic for the feedback arc set problem
Information Processing Letters | 1994-05-19 | Paper |
Graphs of maximum diameter
Discrete Mathematics | 1992-09-27 | Paper |
Optimal algorithms for computing the canonical form of a circular string
Theoretical Computer Science | 1992-09-26 | Paper |
Closed form expressions for the iterated floor function
Discrete Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4155884 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4172389 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4097422 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4097420 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4043895 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4033779 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4043877 (Why is no real title available?) | 1987-01-01 | Paper |
Sharp Bounds on the Diameter of a Graph
Canadian Mathematical Bulletin | 1987-01-01 | Paper |
Evaluating Measure of Program Quality
The Computer Journal | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4014755 (Why is no real title available?) | 1986-01-01 | Paper |
Algorithms for the reduction of matrix bandwidth and profile
Journal of Computational and Applied Mathematics | 1985-01-01 | Paper |
Constant Limit of a Sequence of Iterates
SIAM Journal on Mathematical Analysis | 1979-01-01 | Paper |
| The Construction of Rational Iterating Functions | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3770856 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3477217 (Why is no real title available?) | 1974-01-01 | Paper |
A storage scheme for hierarchic structures
The Computer Journal | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3410504 (Why is no real title available?) | 1972-01-01 | Paper |
