| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5874188 | 2023-02-07 | Paper |
| Balancing Straight-line Programs | 2022-12-08 | Paper |
| Word equations in non-deterministic linear space | 2021-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005113 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009593 | 2021-08-04 | Paper |
| The Smallest Grammar Problem Revisited | 2021-02-22 | Paper |
| Solving one variable word equations in the free group in cubic time | 2021-01-15 | Paper |
| Recompression: technique for word equations and compressed data | 2020-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111427 | 2020-05-27 | Paper |
| Deciding Context Unification | 2020-02-11 | Paper |
| Deciding context unification (with regular constraints) | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633927 | 2019-05-06 | Paper |
| Faster Fully Compressed Pattern Matching by Recompression | 2018-10-30 | Paper |
| On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars | 2018-10-02 | Paper |
| Recompression | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636583 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598269 | 2017-12-19 | Paper |
| Validating the Knuth-Morris-Pratt failure function, fast and online | 2017-11-07 | Paper |
| Constructing small tree grammars and small circuits for formulas | 2017-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965507 | 2017-03-03 | Paper |
| Unambiguous conjunctive grammars over a one-symbol alphabet | 2017-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957887 | 2017-01-30 | Paper |
| Approximation of smallest linear tree grammar | 2016-11-18 | Paper |
| Finding all solutions of equations in free groups and monoids with involution | 2016-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819404 | 2016-09-29 | Paper |
| Equations over sets of integers with addition only | 2016-06-13 | Paper |
| One-variable word equations in linear time | 2016-03-23 | Paper |
| Least and greatest solutions of equations over sets of integers | 2016-02-26 | Paper |
| A \textit{really} simple approximation of smallest grammar | 2016-01-21 | Paper |
| Approximation of grammar-based compression via recompression | 2015-10-08 | Paper |
| The complexity of compressed membership problems for finite automata | 2015-02-05 | Paper |
| Computational completeness of equations over sets of natural numbers | 2014-07-18 | Paper |
| Context Unification is in PSPACE | 2014-07-01 | Paper |
| A really Simple Approximation of Smallest Grammar | 2014-06-30 | Paper |
| Finding All Solutions of Equations in Free Groups and Monoids with Involution | 2014-06-24 | Paper |
| HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA | 2014-03-10 | Paper |
| Faster Fully Compressed Pattern Matching by Recompression | 2013-08-12 | Paper |
| One-Variable Word Equations in Linear Time | 2013-08-07 | Paper |
| Recompression: Word Equations and Beyond | 2013-06-28 | Paper |
| Unambiguous Conjunctive Grammars over a One-Letter Alphabet | 2013-06-28 | Paper |
| Approximation of Grammar-Based Compression via Recompression | 2013-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4913002 | 2013-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910734 | 2013-03-19 | Paper |
| Collecting weighted items from a dynamic queue | 2013-03-05 | Paper |
| A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue | 2013-03-04 | Paper |
| Representing hyper-arithmetical sets by equations over sets of integers | 2012-12-07 | Paper |
| On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars | 2012-11-02 | Paper |
| Hyper-minimization for Deterministic Tree Automata | 2012-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904756 | 2012-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390009 | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113773 | 2012-01-23 | Paper |
| One-nonterminal conjunctive grammars over a unary alphabet | 2011-10-11 | Paper |
| On Minimising Automata with Errors | 2011-08-17 | Paper |
| Computing All ℓ-Cover Automata Fast | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3005912 | 2011-06-10 | Paper |
| Complexity of equations over sets of natural numbers | 2011-03-30 | Paper |
| Least and Greatest Solutions of Equations over Sets of Integers | 2010-09-03 | Paper |
| On the two-dimensional cow search problem | 2010-08-16 | Paper |
| Validating the Knuth-Morris-Pratt Failure Function, Fast and Online | 2010-06-22 | Paper |
| Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth | 2010-03-05 | Paper |
| Hyper-minimisation Made Efficient | 2009-10-16 | Paper |
| One-Nonterminal Conjunctive Grammars over a Unary Alphabet | 2009-08-18 | Paper |
| CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES | 2008-11-24 | Paper |
| On the Computational Completeness of Equations over Sets of Natural Numbers | 2008-08-19 | Paper |
| Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth | 2008-06-03 | Paper |
| Graphical complexity of products of permutation groups | 2008-02-11 | Paper |
| Conjunctive Grammars Can Generate Non-regular Unary Languages | 2007-11-28 | Paper |
| Generalized Cauchy identities, trees and multidimensional Brownian motions. Part II: Combinatorial differential calculus | 2007-08-25 | Paper |
