| Publication | Date of Publication | Type |
|---|
| Constructing and indexing the bijective and extended Burrows-Wheeler transform | 2024-03-27 | Paper |
| Sparse suffix trees | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098777 | 2023-06-14 | Paper |
| String inference from longest-common-prefix array | 2022-12-21 | Paper |
| Indexing the bijective BWT | 2022-07-18 | Paper |
| Linear-time string indexing and analysis in small space | 2021-05-03 | Paper |
| On suffix tree breadth | 2021-02-16 | Paper |
| Block trees | 2021-02-02 | Paper |
| Tight upper and lower bounds on suffix tree breadth | 2021-01-25 | Paper |
| String inference from longest-common-prefix array | 2020-05-27 | Paper |
| Engineering External Memory Induced Suffix Sorting | 2019-09-12 | Paper |
| Faster filters for approximate string matching | 2019-09-11 | Paper |
| Fixed block compression boosting in FM-indexes: theory and practice | 2019-04-25 | Paper |
| Better external memory LCP array construction | 2019-03-27 | Paper |
| LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os | 2018-10-17 | Paper |
| Engineering external memory LCP array construction: parallel, in-place and large alphabet | 2018-08-13 | Paper |
| Diverse Palindromic Factorization is NP-Complete | 2018-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636645 | 2018-04-19 | Paper |
| Faster External Memory LCP Array Construction | 2018-03-02 | Paper |
| Lempel-Ziv index for \(q\)-grams | 2017-12-05 | Paper |
| Engineering a lightweight external memory suffix array construction algorithm | 2017-07-17 | Paper |
| Lazy Lempel-Ziv factorization algorithms | 2017-06-16 | Paper |
| LCP array construction in external memory | 2017-06-16 | Paper |
| Better external memory suffix array construction | 2017-06-15 | Paper |
| Faster sparse suffix sorting | 2017-03-03 | Paper |
| Tighter bounds for the sum of irreducible LCP values | 2017-02-06 | Paper |
| \(V\)-order: new combinatorial properties \& a simple comparison algorithm | 2016-10-07 | Paper |
| Linear work suffix array construction | 2015-12-04 | Paper |
| Diverse Palindromic Factorization Is NP-complete | 2015-11-10 | Paper |
| Parallel External Memory Suffix Sorting | 2015-08-20 | Paper |
| Tighter bounds for the sum of irreducible LCP values | 2015-08-20 | Paper |
| Computing the Burrows-Wheeler transform in place and in small space | 2015-05-04 | Paper |
| A subquadratic algorithm for minimum palindromic factorization | 2014-09-05 | Paper |
| Multi-pattern matching with bidirectional indexes | 2014-08-13 | Paper |
| String range matching | 2014-06-30 | Paper |
| LZ77-based self-indexing with faster pattern matching | 2014-03-31 | Paper |
| Colored range queries and document retrieval | 2014-01-09 | Paper |
| Versatile succinct representations of the bidirectional Burrows-Wheeler transform | 2013-09-17 | Paper |
| A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform | 2013-06-14 | Paper |
| Linear Time Lempel-Ziv Factorization: Simple, Fast, Small | 2013-06-14 | Paper |
| Multi-pattern matching with bidirectional indexes | 2012-09-25 | Paper |
| Indexed multi-pattern matching | 2012-06-29 | Paper |
| A faster grammar-based self-index | 2012-06-08 | Paper |
| Counting Colours in Compressed Strings | 2011-06-29 | Paper |
| Medium-Space Algorithms for Inverse BWT | 2010-09-06 | Paper |
| Fast lightweight suffix array construction and checking | 2010-04-06 | Paper |
| Permuted Longest-Common-Prefix Array | 2009-07-07 | Paper |
| Fast BWT in small space by blockwise suffix sorting | 2007-12-19 | Paper |
| BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS | 2005-12-15 | Paper |
| Computing the Threshold for q-Gram Filters | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737702 | 2004-08-11 | Paper |
| Approximate string matching on Ziv--Lempel compressed text | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449231 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432972 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428995 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547737 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723951 | 2001-07-08 | Paper |
| Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951153 | 2000-05-03 | Paper |
| Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time | 2000-03-19 | Paper |
| Lempel-Ziv index for \(q\)-grams | 1998-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128935 | 1997-10-05 | Paper |
