| Publication | Date of Publication | Type |
|---|
| The complexity of knapsack problems in wreath products | 2026-03-18 | Paper |
| Revisiting membership problems in subclasses of rational relations | 2026-02-27 | Paper |
| The complexity of bidirected reachability in valence systems | 2024-12-06 | Paper |
| Ramsey quantifiers over automatic structures: complexity and applications to verification | 2024-12-06 | Paper |
| Context-bounded analysis of concurrent programs (invited talk) | 2024-11-14 | Paper |
| Checking refinement of asynchronous programs against context-free specifications | 2024-11-14 | Paper |
| Low-latency sliding window algorithms for formal languages | 2024-09-12 | Paper |
| Pattern matching on grammar-compressed strings in linear time | 2024-07-19 | Paper |
| Reachability in bidirected pushdown VASS | 2024-06-24 | Paper |
| Existential definability over the subword ordering | 2024-04-23 | Paper |
Existential Definability over the Subword Ordering
Logical Methods in Computer Science | 2024-01-16 | Paper |
Unboundedness problems for machines with reversal-bounded counters
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Compression by Contracting Straight-Line Programs
(available as arXiv preprint) | 2023-09-20 | Paper |
Knapsack and the power word problem in solvable Baumslag–Solitar groups
International Journal of Algebra and Computation | 2023-06-01 | Paper |
| Automatic Equivalence Structures of Polynomial Growth. | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650239 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Balancing Straight-line Programs
Journal of the ACM | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559138 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Sliding windows over context-free languages | 2021-08-04 | Paper |
Derandomization for sliding window algorithms with strict correctness
Theory of Computing Systems | 2021-08-03 | Paper |
Randomized sliding window algorithms for regular languages
(available as arXiv preprint) | 2021-07-28 | Paper |
| A characterization of wreath products where knapsack is decidable | 2021-01-15 | Paper |
Automata theory on sliding windows
(available as arXiv preprint) | 2020-08-05 | Paper |
Knapsack problems for wreath products
(available as arXiv preprint) | 2020-08-05 | Paper |
| The complexity of knapsack problems in wreath products | 2020-02-19 | Paper |
Universal Tree Source Coding Using Grammar-Based Compression
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Circuits and Expressions over Finite Semirings
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
A universal tree balancing theorem
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Derandomization for sliding window algorithms with strict correctness
Computer Science – Theory and Applications | 2019-10-22 | Paper |
scientific article; zbMATH DE number 6970796 (Why is no real title available?)
(available as arXiv preprint) | 2018-11-02 | Paper |
| Sliding window algorithms for regular languages | 2018-06-26 | Paper |
| Querying regular languages over sliding windows | 2018-04-19 | Paper |
Circuit evaluation for finite semirings
(available as arXiv preprint) | 2018-04-19 | Paper |
Tree compression using string grammars
Algorithmica | 2018-04-11 | Paper |
| On the parallel complexity of bisimulation on finite systems | 2017-07-19 | 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 |
Tree compression using string grammars
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Parity games of bounded tree- and clique-width
Lecture Notes in Computer Science | 2015-10-01 | Paper |
