| Publication | Date of Publication | Type |
|---|
| Efficient algorithms for Lempel-Ziv encoding | 2022-12-09 | Paper |
| Pattern-matching problems for 2-dimensional images described by finite automata | 2022-12-09 | Paper |
| Speeding up two string-matching algorithms | 2022-08-18 | Paper |
| On the size of independent systems of equations in semigroups | 2022-08-18 | Paper |
| Polynomial size test sets for context-free languages | 2019-12-04 | Paper |
| On PSPACE generation of a solution set of a word equation and its applications | 2019-10-07 | Paper |
| On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) | 2019-10-07 | Paper |
| Compactness of systems of equations in semigroups | 2019-01-10 | Paper |
| The expressibility of languages and relations by word equations | 2018-07-04 | Paper |
| Two-dimensional pattern matching in linear time and small space | 2017-12-04 | Paper |
| Finding all solutions of equations in free groups and monoids with involution | 2016-11-18 | Paper |
| Satisfiability of word equations with constants is in NEXPTIME | 2016-09-29 | Paper |
| Complete Characterization of Zero-expressible Functions | 2016-04-28 | Paper |
| An efficient algorithm for solving word equations | 2014-11-25 | Paper |
| Finding All Solutions of Equations in Free Groups and Monoids with Involution | 2014-06-24 | Paper |
| On word equations in one variable | 2011-07-01 | Paper |
| WORD EQUATIONS WITH ONE UNKNOWN | 2011-03-30 | Paper |
| Satisfiability of word equations with constants is in PSPACE | 2010-08-17 | Paper |
| Shortest synchronizing strings for Huffman codes | 2009-09-10 | Paper |
| On systems of word equations over three unknowns with at most six occurrences of one of the unknowns | 2009-08-07 | Paper |
| Word Equations with One Unknown | 2009-07-07 | Paper |
| On special families of morphisms related to \(\delta \)-matching and don't care symbols | 2009-03-23 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024808 | 2005-07-04 | Paper |
| On the complexity of decidable cases of the commutation problem of languages | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737699 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452053 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432970 | 2003-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708962 | 2003-06-26 | Paper |
| The expressibility of languages and relations by word equations | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708571 | 2003-06-18 | Paper |
| On the complexity of pattern matching for highly compressed two-dimensional texts. | 2003-05-14 | Paper |
| Locally periodic versus globally periodic infinite words | 2003-03-26 | Paper |
| The complexity of compressing subsegments of images described by finite automata | 2003-03-09 | Paper |
| A defect theorem for bi-infinite words. | 2003-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782709 | 2002-12-02 | Paper |
| Fast practical multi-pattern matching | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234122 | 2002-01-30 | Paper |
| On the expressibility of languages by word equations with a bounded number of variables | 2002-01-14 | Paper |
| Two-variable word equations | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500842 | 2001-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501527 | 2000-09-04 | Paper |
| Algorithms for the parallel alternating direction access machine | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941166 | 2000-02-29 | Paper |
| Generalized factorizations of words and their algorithmic properties | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218145 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219037 | 1998-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219050 | 1998-11-15 | Paper |
| Compactness of Systems of Equations in Semigroups | 1998-02-25 | Paper |
| The zooming method: A recursive approach to time-space efficient string-matching | 1997-09-29 | Paper |
| Parallel tree-contraction and Fibonacci numbers | 1997-02-27 | Paper |
| On the size of independent systems of equations in semigroups | 1997-02-27 | Paper |
| Polynomial size test sets for context-free languages | 1996-03-18 | Paper |
| Speeding up two string-matching algorithms | 1996-02-26 | Paper |
