| Publication | Date of Publication | Type |
|---|
| String Covering: A Survey | 2024-02-02 | Paper |
| Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order | 2021-07-22 | Paper |
| A new approach to regular \& indeterminate strings | 2021-01-25 | Paper |
| More properties of the Fibonacci word on an infinite alphabet | 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 | 2019-10-07 | Paper |
| Palindromes in starlike trees | 2019-05-23 | Paper |
| Frequency Covers for Strings | 2019-01-17 | Paper |
| String covering with optimal covers | 2019-01-04 | Paper |
| Lyndon array construction during Burrows-Wheeler inversion | 2018-12-14 | Paper |
| Reconstructing a string from its Lyndon arrays | 2018-02-16 | Paper |
| Constructing an indeterminate string from its associated graph | 2018-02-16 | Paper |
| Counting Lyndon factors | 2017-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5267518 | 2017-06-13 | Paper |
| A prefix array for parameterized strings | 2017-02-14 | Paper |
| Large-scale detection of repetitions | 2017-01-13 | Paper |
| \(V\)-order: new combinatorial properties \& a simple comparison algorithm | 2016-10-07 | Paper |
| Computing covers using prefix tables | 2016-09-12 | Paper |
| The new periodicity lemma revisited | 2016-09-12 | Paper |
| A note on easy and efficient computation of full abelian periods of a word | 2016-09-12 | Paper |
| Simple Linear Comparison of Strings in V-order* | 2016-05-11 | Paper |
| Indeterminate strings, prefix arrays \& undirected graphs | 2015-09-16 | Paper |
| Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance | 2015-09-15 | Paper |
| Three overlapping squares: the general case characterized \& applications | 2015-07-24 | Paper |
| Inferring an indeterminate string from a prefix graph | 2015-05-04 | Paper |
| A comparison of index-based lempel-Ziv LZ77 factorization algorithms | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5169577 | 2014-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5169580 | 2014-07-10 | Paper |
| A bijective variant of the Burrows-Wheeler transform using \(V\)-order | 2014-03-28 | Paper |
| Simple Linear Comparison of Strings in V-Order | 2014-02-18 | Paper |
| Prefix Table Construction and Conversion | 2014-01-17 | Paper |
| Enhanced string covering | 2014-01-16 | Paper |
| A linear partitioning algorithm for hybrid Lyndons using \(V\)-order | 2014-01-09 | Paper |
| More results on overlapping squares | 2013-06-24 | Paper |
| Generic Algorithms for Factoring Strings | 2013-04-09 | Paper |
| Computing regularities in strings: a survey | 2012-11-15 | Paper |
| The three squares lemma revisited | 2012-05-11 | Paper |
| Minimum Unique Substrings and Maximum Repeats | 2011-11-22 | Paper |
| String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time | 2011-06-29 | Paper |
| New complexity results for the \(k\)-covers problem | 2011-06-22 | Paper |
| Fast, practical algorithms for computing all the repeats in a string | 2011-02-19 | Paper |
| Combinatorics of Unique Maximal Factorization Families (UMFFs) | 2010-02-05 | Paper |
| Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences | 2010-02-05 | Paper |
| AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS | 2010-01-08 | Paper |
| A new approach to the periodicity lemma on strings with holes | 2009-10-09 | Paper |
| Fast pattern-matching on indeterminate strings | 2008-11-18 | Paper |
| IDENTIFYING RHYTHMS IN MUSICAL TEXTS | 2008-11-03 | Paper |
| Lempel-Ziv factorization using less time \& space | 2008-09-08 | Paper |
| How many runs can a string contain? | 2008-07-31 | Paper |
| Fast and Practical Algorithms for Computing All the Runs in a String | 2008-06-17 | Paper |
| A simple fast hybrid pattern-matching algorithm | 2008-05-29 | Paper |
| Two-pattern strings. II: Frequency of occurrence and substring complexity | 2008-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446124 | 2008-03-06 | Paper |
| Finding Patterns with Variable Length Gaps or Don’t Cares | 2007-09-10 | Paper |
| A New Periodicity Lemma | 2007-09-06 | Paper |
| RECONSTRUCTING A SUFFIX ARRAY | 2007-02-08 | Paper |
| On optimum summable graphs | 2006-10-12 | Paper |
| SORTING SUFFIXES OF TWO-PATTERN STRINGS | 2005-12-15 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024803 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820869 | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820870 | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737691 | 2004-08-11 | Paper |
| Two-pattern strings. I: A recognition algorithm | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4454546 | 2004-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4454548 | 2004-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4795855 | 2003-04-06 | Paper |
| Computing the cover array in linear time | 2002-10-23 | Paper |
| Approximate periods of strings | 2002-03-03 | Paper |
| Repetitive perhaps, but certainly not boring | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4239593 | 1999-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839717 | 1998-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4379745 | 1998-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4351065 | 1998-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4367783 | 1997-12-02 | Paper |
| COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH | 1997-01-27 | Paper |
| A fast average case algorithm for lyndon decomposition | 1996-10-07 | Paper |
| A family of sparse graphs of large sum number | 1995-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853720 | 1995-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853725 | 1995-11-02 | Paper |
| Parallel RAM algorithms for factorizing words | 1995-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137215 | 1994-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136991 | 1994-06-28 | Paper |
| A fast and effective heuristic for the feedback arc set problem | 1994-05-19 | Paper |
| Graphs of maximum diameter | 1992-09-27 | Paper |
| Optimal algorithms for computing the canonical form of a circular string | 1992-09-26 | Paper |
| Closed form expressions for the iterated floor function | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197327 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484354 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824439 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824441 | 1988-01-01 | Paper |
| Sharp Bounds on the Diameter of a Graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773907 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781782 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781797 | 1987-01-01 | Paper |
| Evaluating Measure of Program Quality | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3027040 | 1986-01-01 | Paper |
| Algorithms for the reduction of matrix bandwidth and profile | 1985-01-01 | Paper |
| Constant Limit of a Sequence of Iterates | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3951465 | 1978-01-01 | Paper |
| The Construction of Rational Iterating Functions | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4060991 | 1974-01-01 | Paper |
| A storage scheme for hierarchic structures | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5674871 | 1972-01-01 | Paper |
