| Publication | Date of Publication | Type |
|---|
| Inferring strings from position heaps in linear time | 2023-11-24 | Paper |
| Computing the parameterized Burrows-Wheeler transform online | 2023-08-04 | Paper |
| Linear-time online algorithm for inferring the shortest path graph from a walk label | 2023-07-28 | Paper |
| Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences | 2023-02-07 | Paper |
| In-place bijective burrows-wheeler transforms | 2023-02-07 | Paper |
| DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures | 2023-02-07 | Paper |
| Computing Covers Under Substring Consistent Equivalence Relations | 2022-12-22 | Paper |
| On the hardness of approximating the minimum consistent OBDD problem | 2022-12-09 | Paper |
| Parameterized DAWGs: efficient constructions and bidirectional pattern searches | 2022-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020531 | 2022-01-06 | Paper |
| Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data | 2020-11-19 | Paper |
| New Variants of Pattern Matching with Constants and Variables | 2020-10-21 | Paper |
| Duel and Sweep Algorithm for Order-Preserving Pattern Matching | 2020-10-21 | Paper |
| Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching | 2020-07-20 | Paper |
| Position Heaps for Parameterized Strings | 2020-05-25 | Paper |
| Efficient computation of longest single-arm-gapped palindromes in a string | 2020-02-20 | Paper |
| Linear-time online algorithm for inferring the shortest path graph from a walk label | 2020-02-20 | Paper |
| Efficient dynamic dictionary matching with DAWGs and AC-automata | 2019-10-07 | Paper |
| Permuted pattern matching algorithms on multi-track strings | 2019-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645655 | 2019-01-10 | Paper |
| Enumeration of cryptarithms using deterministic finite automata | 2018-11-07 | Paper |
| AC-automaton update algorithm for semi-dynamic dictionary matching | 2018-10-17 | Paper |
| Linear-time text compression by longest-first substitution | 2018-08-20 | Paper |
| Functional programs as compressed data | 2017-05-15 | Paper |
| Compact bit encoding schemes for simply-typed lambda-terms | 2017-05-10 | Paper |
| Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings | 2017-04-04 | Paper |
| Computing Longest Single-arm-gapped Palindromes in a String | 2017-04-04 | Paper |
| Average number of occurrences of repetitions in a necklace | 2015-09-22 | Paper |
| Detecting regularities on grammar-compressed strings | 2015-01-30 | Paper |
| Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints | 2015-01-13 | Paper |
| Permuted Pattern Matching on Multi-track Strings | 2014-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414581 | 2014-05-06 | Paper |
| Detecting Regularities on Grammar-Compressed Strings | 2013-09-20 | Paper |
| Ternary Directed Acyclic Word Graphs | 2010-05-07 | Paper |
| String Processing and Information Retrieval | 2010-02-09 | Paper |
| String Processing and Information Retrieval | 2010-02-09 | Paper |
| AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING | 2010-01-08 | Paper |
| A Series of Run-Rich Strings | 2009-04-02 | Paper |
| Efficient algorithms to compute compressed longest common substrings and compressed palindromes | 2009-03-17 | Paper |
| Computing Longest Common Substring and All Palindromes from Compressed Strings | 2008-03-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Compact directed acyclic word graphs for a sliding window | 2007-04-26 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. | 2006-01-17 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS | 2005-12-15 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| The size of subsequence automaton | 2005-09-22 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | 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/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/Q4470572 | 2004-07-01 | 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 |
| 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/Q4703873 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253322 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347161 | 1997-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126929 | 1997-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688904 | 1997-03-19 | Paper |
| Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions | 1997-02-28 | Paper |
| A machine discovery from amino acid sequences by decision trees over regular patterns | 1994-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202913 | 1993-09-06 | Paper |
| Teachability in computational learning | 1991-01-01 | Paper |
