| Publication | Date of Publication | Type |
|---|
| Space-efficient conversions from SLPs | 2024-05-31 | Paper |
| Decision procedures for sequence theories | 2024-01-12 | Paper |
| Solving word equations (and other unification problems) by recompression (invited talk) | 2023-02-07 | Paper |
Balancing Straight-line Programs
Journal of the ACM | 2022-12-08 | Paper |
Word equations in non-deterministic linear space
Journal of Computer and System Sciences | 2021-10-28 | Paper |
| Edit distance with block operations | 2021-08-04 | Paper |
| Sliding windows over context-free languages | 2021-08-04 | Paper |
The Smallest Grammar Problem Revisited
IEEE Transactions on Information Theory | 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 |
Word equations in nondeterministic linear space
(available as arXiv preprint) | 2020-05-27 | Paper |
Deciding context unification
Journal of the ACM | 2020-02-11 | Paper |
| Deciding context unification (with regular constraints) | 2019-10-15 | Paper |
| Collecting weighted items from a dynamic queue | 2019-05-06 | Paper |
Faster fully compressed pattern matching by recompression
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On the number of nonterminal symbols in unambiguous conjunctive grammars
Fundamenta Informaticae | 2018-10-02 | Paper |
Recompression: a simple and powerful technique for word equations
Journal of the ACM | 2018-08-02 | Paper |
| LZ77 factorisation of trees | 2018-04-19 | Paper |
Solutions of word equations over partially commutative structures
(available as arXiv preprint) | 2017-12-19 | Paper |
Validating the Knuth-Morris-Pratt failure function, fast and online
Theory of Computing Systems | 2017-11-07 | Paper |
Constructing small tree grammars and small circuits for formulas
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Constructing small tree grammars and small circuits for formulas
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Approximation of smallest linear tree grammar
(available as arXiv preprint) | 2017-03-03 | Paper |
Unambiguous conjunctive grammars over a one-symbol alphabet
Theoretical Computer Science | 2017-02-06 | Paper |
scientific article; zbMATH DE number 6678923 (Why is no real title available?)
(available as arXiv preprint) | 2017-01-30 | Paper |
Approximation of smallest linear tree grammar
Information and Computation | 2016-11-18 | Paper |
Finding all solutions of equations in free groups and monoids with involution
Information and Computation | 2016-11-18 | Paper |
Length-reducing automata (almost) without auxiliary symbols
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Equations over sets of integers with addition only
Journal of Computer and System Sciences | 2016-06-13 | Paper |
One-variable word equations in linear time
Algorithmica | 2016-03-23 | Paper |
Least and greatest solutions of equations over sets of integers
Theoretical Computer Science | 2016-02-26 | Paper |
A \textit{really} simple approximation of smallest grammar
Theoretical Computer Science | 2016-01-21 | Paper |
Approximation of grammar-based compression via recompression
Theoretical Computer Science | 2015-10-08 | Paper |
The complexity of compressed membership problems for finite automata
Theory of Computing Systems | 2015-02-05 | Paper |
Computational completeness of equations over sets of natural numbers
Information and Computation | 2014-07-18 | Paper |
Context unification is in PSPACE
Automata, Languages, and Programming | 2014-07-01 | Paper |
A really simple approximation of smallest grammar
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Finding All Solutions of Equations in Free Groups and Monoids with Involution
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Hyper-minimization for deterministic tree automata
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Faster fully compressed pattern matching by recompression
Lecture Notes in Computer Science | 2013-08-12 | Paper |
One-variable word equations in linear time
Automata, Languages, and Programming | 2013-08-07 | Paper |
Unambiguous conjunctive grammars over a one-letter alphabet
Developments in Language Theory | 2013-06-28 | Paper |
Recompression: word equations and beyond
Developments in Language Theory | 2013-06-28 | Paper |
Approximation of Grammar-Based Compression via Recompression
Combinatorial Pattern Matching | 2013-06-14 | Paper |
| Conjunctive grammars and equations over sets of natural numbers | 2013-04-02 | Paper |
| scientific article; zbMATH DE number 6146470 (Why is no real title available?) | 2013-03-19 | Paper |
Collecting weighted items from a dynamic queue
Algorithmica | 2013-03-05 | Paper |
A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue
Theoretical Computer Science | 2013-03-04 | Paper |
Representing hyper-arithmetical sets by equations over sets of integers
Theory of Computing Systems | 2012-12-07 | Paper |
On the number of nonterminal symbols in unambiguous conjunctive grammars
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Hyper-minimization for deterministic tree automata
Implementation and Application of Automata | 2012-09-20 | Paper |
Compressed membership for NFA (DFA) with compressed labels is in NP (P)
(available as arXiv preprint) | 2012-08-23 | Paper |
| Equations over sets of natural numbers with addition only | 2012-04-24 | Paper |
| On equations over sets of integers | 2012-01-23 | Paper |
One-nonterminal conjunctive grammars over a unary alphabet
Theory of Computing Systems | 2011-10-11 | Paper |
On minimising automata with errors
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Computing all \(\ell \)-cover automata fast
Implementation and Application of Automata | 2011-07-29 | Paper |
| scientific article; zbMATH DE number 5906488 (Why is no real title available?) | 2011-06-10 | Paper |
Complexity of equations over sets of natural numbers
Theory of Computing Systems | 2011-03-30 | Paper |
Least and greatest solutions of equations over sets of integers
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the two-dimensional cow search problem
Information Processing Letters | 2010-08-16 | Paper |
Validating the Knuth-Morris-Pratt failure function, fast and online
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
Theory of Computing Systems | 2010-03-05 | Paper |
Hyper-minimisation Made Efficient
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
Computer Science - Theory and Applications | 2009-08-18 | Paper |
CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
On the Computational Completeness of Equations over Sets of Natural Numbers
Automata, Languages and Programming | 2008-08-19 | Paper |
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Computer Science – Theory and Applications | 2008-06-03 | Paper |
Graphical complexity of products of permutation groups
Discrete Mathematics | 2008-02-11 | Paper |
Conjunctive Grammars Can Generate Non-regular Unary Languages
Developments in Language Theory | 2007-11-28 | Paper |
| Generalized Cauchy identities, trees and multidimensional Brownian motions. Part II: Combinatorial differential calculus | 2007-08-25 | Paper |
