| Publication | Date of Publication | Type |
|---|
| Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets | 2023-09-07 | Paper |
| Recovering, counting and enumerating strings from forward and backward suffix arrays | 2023-07-28 | Paper |
| The parameterized suffix tray | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874440 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874456 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875603 | 2023-02-03 | Paper |
| Parameterized DAWGs: efficient constructions and bidirectional pattern searches | 2022-09-27 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2022-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088914 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088918 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088921 | 2022-07-18 | Paper |
| Longest common rollercoasters | 2022-06-15 | Paper |
| Grammar index by induced suffix sorting | 2022-06-15 | Paper |
| On the approximation ratio of LZ-end to LZ77 | 2022-06-15 | Paper |
| c-trie++: a dynamic trie tailored for fast prefix searches | 2022-06-08 | Paper |
| Factorizing strings into repetitions | 2022-05-09 | Paper |
| Computing minimal unique substrings for a sliding window | 2022-03-22 | Paper |
| Palindromic trees for a sliding window and its applications | 2021-10-19 | Paper |
| Efficiently computing runs on a trie | 2021-09-27 | Paper |
| Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings | 2021-06-11 | Paper |
| Counting Lyndon Subsequences | 2021-06-02 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2021-05-18 | Paper |
| Order Preserving Pattern Matching on Trees and DAGs | 2021-02-16 | Paper |
| Computing longest palindromic substring after single-character or block-wise edits | 2021-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140772 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140775 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140779 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140783 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140789 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136252 | 2020-11-25 | Paper |
| Space-efficient algorithms for computing minimal/shortest unique substrings | 2020-10-22 | Paper |
| A Possibility of Nuclear Reaction Near the Three-Body Break-Up Threshold | 2020-07-24 | Paper |
| Faster STR-EC-LCS Computation | 2020-07-20 | Paper |
| Minimal Unique Substrings and Minimal Absent Words in a Sliding Window | 2020-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111224 | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110885 | 2020-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110890 | 2020-05-25 | Paper |
| Shortest unique palindromic substring queries on run-length encoded strings | 2020-02-25 | Paper |
| Dynamic index and LZ factorization in compressed space | 2020-02-14 | Paper |
| The parameterized position heap of a trie | 2020-02-06 | Paper |
| On the size of the smallest alphabet for Lyndon trees | 2019-10-07 | Paper |
| An online algorithm for lightweight grammar-based compression | 2019-03-26 | Paper |
| Algorithms and combinatorial properties on shortest unique palindromic substrings | 2019-01-18 | Paper |
| Linear-time text compression by longest-first substitution | 2018-08-20 | Paper |
| Shortest unique palindromic substring queries in optimal time | 2018-06-15 | Paper |
| Computing abelian string regularities based on RLE | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608599 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608632 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608635 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369533 | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369562 | 2017-10-17 | Paper |
| Efficient computation of substring equivalence classes with suffix arrays | 2017-10-10 | Paper |
| A new characterization of maximal repetitions by Lyndon trees | 2017-10-05 | Paper |
| The “Runs” Theorem | 2017-09-25 | Paper |
| Inferring strings from Lyndon factorization | 2017-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965527 | 2017-03-03 | Paper |
| Faster Lyndon factorization algorithms for SLP and LZ78 compressed text | 2017-02-06 | Paper |
| Generalized pattern matching and periodicity under substring consistent equivalence relations | 2017-02-06 | Paper |
| Finding Gapped Palindromes Online | 2016-09-29 | Paper |
| Inferring Strings from Full Abelian Periods | 2016-01-11 | Paper |
| A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String | 2015-10-02 | Paper |
| Inferring strings from suffix trees and links on a binary alphabet | 2015-09-22 | Paper |
| An Opportunistic Text Indexing Structure Based on Run Length Encoding | 2015-09-21 | Paper |
| LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding | 2015-08-20 | Paper |
| Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree | 2015-08-20 | Paper |
| Constructing LZ78 tries and position heaps in linear time for large alphabets | 2015-06-02 | Paper |
| Compressed automata for dictionary matching | 2015-05-18 | Paper |
| Detecting regularities on grammar-compressed strings | 2015-01-30 | Paper |
| Shortest Unique Substrings Queries in Optimal Time | 2015-01-13 | Paper |
| Inferring Strings from Lyndon Factorization | 2014-10-14 | Paper |
| Computing Palindromic Factorizations and Palindromic Covers On-line | 2014-06-30 | Paper |
| Palindrome pattern matching | 2014-01-09 | Paper |
| Detecting Regularities on Grammar-Compressed Strings | 2013-09-20 | Paper |
| Compressed Automata for Dictionary Matching | 2013-08-07 | Paper |
| Fast \(q\)-gram mining on SLP compressed strings | 2013-06-24 | Paper |
| Converting SLP to LZ78 in almost Linear Time | 2013-06-14 | Paper |
| Efficient Lyndon Factorization of Grammar Compressed Text | 2013-06-14 | Paper |
| Efficient LZ78 Factorization of Grammar Compressed Text | 2013-04-08 | Paper |
| Speeding Up q-Gram Mining on Grammar-Based Compressed Texts | 2012-08-14 | Paper |
| Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts | 2012-06-15 | Paper |
| Online Linear Optimization over Permutations | 2011-12-16 | Paper |
| Verifying and enumerating parameterized border arrays | 2011-12-07 | Paper |
| Palindrome Pattern Matching | 2011-06-29 | Paper |
| Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts | 2011-06-29 | Paper |
| Verifying a Parameterized Border Array in O(n 1.5) Time | 2010-07-26 | Paper |
| Ternary Directed Acyclic Word Graphs | 2010-05-07 | Paper |
| String Processing and Information Retrieval | 2010-02-09 | Paper |
| Lightweight Parameterized Suffix Array Construction | 2009-12-11 | Paper |
| A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA | 2009-08-21 | Paper |
| Counting Parameterized Border Arrays for a Binary Alphabet | 2009-04-02 | Paper |
| A Run-Time Efficient Implementation of Compressed Pattern Matching Automata | 2009-02-12 | Paper |
| REACHABILITY ON SUFFIX TREE GRAPHS | 2008-11-03 | Paper |
| Smooth Boosting for Margin-Based Ranking | 2008-10-14 | Paper |
| Efficient Computation of Substring Equivalence Classes with Suffix Arrays | 2008-06-17 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On-Line Linear-Time Construction of Word Suffix Trees | 2007-09-14 | Paper |
| Compact directed acyclic word graphs for a sliding window | 2007-04-26 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS | 2005-12-15 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024794 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024796 | 2005-07-04 | Paper |
| On-line construction of compact directed acyclic word graphs | 2005-02-22 | Paper |
| Ternary directed acyclic word graphs | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044513 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044547 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737697 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736063 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736067 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474138 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4454542 | 2004-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420643 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708582 | 2003-06-18 | Paper |
| Collage system: A unifying framework for compressed pattern matching. | 2003-05-22 | Paper |
| Uniform characterizations of polynomial-query learnabilities | 2003-05-14 | Paper |
| A practical algorithm to find the best subsequence patterns | 2003-05-14 | Paper |
| Discovering instances of poetic allusion from anthologies of classical Japanese poems | 2003-05-14 | Paper |
| Discovering characteristic expressions in literary works. | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547744 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547748 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547750 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728909 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723950 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4290657 | 1995-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3143040 | 1994-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933780 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942363 | 1982-01-01 | Paper |
