| Publication | Date of Publication | Type |
|---|
| Inferring strings from position heaps in linear time | 2023-11-24 | Paper |
| Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs | 2023-11-24 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2023-10-12 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5874456 | 2023-02-07 | Paper |
| Parameterized DAWGs: efficient constructions and bidirectional pattern searches | 2022-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020531 | 2022-01-06 | Paper |
| Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes | 2021-10-04 | 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 |
| 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 |
| Distributional learning of conjunctive grammars and contextual binary feature grammars | 2019-06-25 | Paper |
| Finding all solutions and instances of Numberlink and Slitherlink by ZDDs | 2019-03-26 | Paper |
| The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant | 2019-02-14 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4599200 | 2017-12-18 | Paper |
| Distributional Learning of Some Nonlinear Tree Grammars | 2017-07-28 | Paper |
| The Strong, Weak, and Very Weak Finite Context and Kernel Properties | 2017-06-01 | Paper |
| The Time Complexity of the Token Swapping Problem and Its Parallel Variants | 2017-05-05 | Paper |
| Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings | 2017-04-04 | Paper |
| Learning concepts and their unions from positive data with refinement operators | 2017-03-06 | Paper |
| Efficiency in the Identification in the Limit Learning Paradigm | 2017-02-15 | Paper |
| Distributional Learning of Context-Free and Multiple Context-Free Grammars | 2017-02-15 | Paper |
| Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars | 2016-12-01 | Paper |
| Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations | 2016-09-12 | Paper |
| Learning Conjunctive Grammars and Contextual Binary Feature Grammars | 2016-04-08 | Paper |
| Probabilistic learnability of context-free grammars with basic distributional properties from positive examples | 2016-02-26 | Paper |
| The failure of the strong pumping lemma for multiple context-free languages | 2015-02-05 | Paper |
| Distributional learning of parallel multiple context-free grammars | 2014-12-05 | Paper |
| A comparison of collapsed Bayesian methods for probabilistic finite automata | 2014-12-05 | Paper |
| An Algebraic Approach to Multiple Context-Free Grammars | 2014-06-24 | Paper |
| PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data | 2013-11-06 | Paper |
| Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher | 2012-11-02 | Paper |
| Counterexamples to the long-standing conjecture on the complexity of BDD binary operations | 2012-10-23 | Paper |
| Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars | 2012-06-08 | Paper |
| Distributional Learning of Simple Context-Free Tree Grammars | 2011-10-19 | Paper |
| Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices | 2011-07-29 | Paper |
| Well-Nestedness Properly Subsumes Strict Derivational Minimalism | 2011-07-01 | Paper |
| Distributional Learning of Abstract Categorial Grammars | 2011-07-01 | Paper |
| Efficient learning of multiple context-free languages with multidimensional substitutability from positive data | 2011-04-14 | Paper |
| Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries | 2010-09-10 | Paper |
| An elementary proof of a generalization of double Greibach normal form | 2010-08-16 | Paper |
| Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages | 2010-05-26 | Paper |
| Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data | 2009-12-01 | Paper |
| Learning efficiency of very simple grammars from positive data | 2009-05-12 | Paper |
| Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data | 2008-11-27 | Paper |
| An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs | 2008-11-20 | Paper |
| Identification in the Limit of k,l-Substitutable Context-Free Languages | 2008-10-16 | Paper |
| Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning | 2008-09-04 | Paper |
| Learning Efficiency of Very Simple Grammars from Positive Data | 2008-08-19 | Paper |
| On Two Extensions of Abstract Categorial Grammars | 2008-05-15 | Paper |
| Logical Aspects of Computational Linguistics | 2005-11-23 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
