| Publication | Date of Publication | Type |
|---|
Parameterized Complexity of Factorization Problems (available as arXiv preprint) | N/A | Paper |
| FO-query enumeration over SLP-compressed structures of bounded degree | 2026-08-05 | Paper |
Parameterized complexity of factorization problems Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
| Streaming in graph products | 2026-05-12 | Paper |
| Subgroup membership in GL\((2,\mathbb{Z})\) | 2026-04-21 | Paper |
MSO-enumeration over SLP-compressed unranked forests TheoretiCS | 2026-03-23 | Paper |
| The complexity of knapsack problems in wreath products | 2026-03-18 | Paper |
| Finding cycle types in permutation groups with few generators | 2026-01-28 | Paper |
| Balancing straight-line programs | 2025-08-12 | Paper |
| Parallel complexity in group theory | 2025-05-27 | Paper |
Regular languages in the sliding window model TheoretiCS | 2025-05-06 | Paper |
Membership problems in finite groups Journal of Algebra | 2025-04-22 | Paper |
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems ACM Transactions on Computation Theory | 2025-02-21 | Paper |
| Membership problems in infinite groups | 2025-02-07 | Paper |
| Exponent equations in HNN-extensions | 2025-01-17 | Paper |
| On the complexity of diameter and related problems in permutation groups | 2024-11-14 | Paper |
Compressed decision problems in hyperbolic groups Groups, Geometry, and Dynamics | 2024-10-15 | Paper |
Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\) Theory of Computing Systems | 2024-10-07 | Paper |
| Low-latency sliding window algorithms for formal languages | 2024-09-12 | Paper |
Exponent equations in HNN-extensions Journal of Groups, Complexity, Cryptology | 2024-09-10 | Paper |
| Membership problems in finite groups | 2024-08-06 | Paper |
| Streaming word problems | 2024-08-06 | Paper |
The power word problem in graph products Theory of Computing Systems | 2024-07-29 | Paper |
Knapsack and the power word problem in solvable Baumslag–Solitar groups International Journal of Algebra and Computation | 2023-06-01 | Paper |
Complexity of word problems for HNN-extensions Journal of Computer and System Sciences | 2023-04-21 | 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 for strings and trees | 2022-12-16 | Paper |
Balancing Straight-line Programs Journal of the ACM | 2022-12-08 | Paper |
The power word problem (available as arXiv preprint) | 2022-07-21 | Paper |
Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems (available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559438 (Why is no real title available?) (available as arXiv preprint) | 2022-07-18 | Paper |
Compressed decision problems in hyperbolic groups (available as arXiv preprint) | 2022-07-18 | Paper |
| Membership Problems in Finite Groups | 2022-06-23 | Paper |
Complexity of word problems for HNN-extensions Fundamentals of Computation Theory | 2022-05-20 | Paper |
| Compression techniques in group theory | 2022-03-22 | Paper |
Entropy Bounds for Grammar-Based Tree Compressors IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Exponent equations in HNN-extensions | 2022-02-08 | Paper |
| Streaming word problems | 2022-02-08 | Paper |
Closure properties of knapsack semilinear groups Journal of Algebra | 2021-10-22 | Paper |
| Sliding windows over context-free languages | 2021-08-04 | Paper |
| Average case analysis of leaf-centric binary tree sources | 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 |
The Smallest Grammar Problem Revisited IEEE Transactions on Information Theory | 2021-02-22 | Paper |
| scientific article; zbMATH DE number 7297838 (Why is no real title available?) | 2021-01-19 | Paper |
Largest common prefix of a regular tree language Journal of Computer and System Sciences | 2020-10-23 | 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 |
| A Comparison of Empirical Tree Entropies | 2020-06-01 | Paper |
| Counting problems for Parikh images | 2020-05-26 | Paper |
Grammar-based compression of unranked trees Theory of Computing Systems | 2020-02-27 | Paper |
| The complexity of knapsack problems in wreath products | 2020-02-19 | Paper |
Knapsack and the power word problem in solvable Baumslag-Solitar groups (available as arXiv preprint) | 2020-02-07 | Paper |
Largest common prefix of a regular tree language Fundamentals of Computation Theory | 2020-01-30 | Paper |
Universal Tree Source Coding Using Grammar-Based Compression IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Knapsack in hyperbolic groups Journal of Algebra | 2019-12-27 | 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 |
Closure properties of knapsack semilinear groups (available as arXiv preprint) | 2019-11-28 | Paper |
Derandomization for sliding window algorithms with strict correctness Computer Science – Theory and Applications | 2019-10-22 | Paper |
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems (available as arXiv preprint) | 2019-09-30 | Paper |
Size-optimal top dag compression Information Processing Letters | 2019-05-10 | Paper |
The power word problem (available as arXiv preprint) | 2019-04-17 | Paper |
Grammar-based compression of unranked trees Lecture Notes in Computer Science | 2018-11-28 | Paper |
scientific article; zbMATH DE number 6970796 (Why is no real title available?) (available as arXiv preprint) | 2018-11-02 | Paper |
Knapsack in hyperbolic groups Lecture Notes in Computer Science | 2018-10-23 | Paper |
The smallest grammar problem revisited (available as arXiv preprint) | 2018-10-17 | Paper |
Parallel identity testing for skew circuits with big powers and applications International Journal of Algebra and Computation | 2018-10-12 | Paper |
Constant-time tree traversal and subtree equality check for grammar-compressed trees Algorithmica | 2018-07-25 | Paper |
| Compression of unordered XML trees | 2018-07-18 | Paper |
| Sliding window algorithms for regular languages | 2018-06-26 | Paper |
Evaluation of circuits over nilpotent and polycyclic groups Algorithmica | 2018-05-18 | Paper |
| Average Case Analysis of Leaf-Centric Binary Tree Sources | 2018-04-27 | Paper |
| Querying regular languages over sliding windows | 2018-04-19 | Paper |
Circuit evaluation for finite semirings (available as arXiv preprint) | 2018-04-19 | Paper |
The Complexity of Knapsack in Graph Groups (available as arXiv preprint) | 2018-04-19 | Paper |
Tree compression using string grammars Algorithmica | 2018-04-11 | Paper |
Knapsack in graph groups Theory of Computing Systems | 2018-03-01 | Paper |
Knapsack in graph groups, HNN-extensions and amalgamated products (available as arXiv preprint) | 2018-01-24 | Paper |
Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints Theory of Computing Systems | 2017-10-20 | Paper |
Processing succinct matrices and vectors Theory of Computing Systems | 2017-10-20 | Paper |
Path checking for MTL and TPTL over data words Logical Methods in Computer Science | 2017-10-12 | Paper |
| Temporal logics with local constraints (invited talk) | 2017-08-31 | Paper |
| On the parallel complexity of bisimulation on finite systems | 2017-07-19 | Paper |
On Boolean closed full trios and rational Kripke frames Theory of Computing Systems | 2017-07-17 | 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 |
The complexity of decomposing modal and first-order theories 2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Constructing small tree grammars and small circuits for formulas | 2017-04-25 | Paper |
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups Algebra and Computer Science | 2017-04-11 | Paper |
Approximation of smallest linear tree grammar (available as arXiv preprint) | 2017-03-03 | Paper |
| On Boolean closed full trios and rational Kripke frames | 2017-03-03 | Paper |
Random presentations and random subgroups: a survey (available as arXiv preprint) | 2017-02-07 | Paper |
| Compression of rewriting systems for termination analysis | 2017-02-01 | Paper |
Approximation of smallest linear tree grammar Information and Computation | 2016-11-18 | Paper |
The rational subset membership problem for groups: a survey Groups St Andrews 2013 | 2016-07-29 | Paper |
Tree compression using string grammars Lecture Notes in Computer Science | 2016-05-03 | Paper |
XML compression via directed acyclic graphs Theory of Computing Systems | 2016-04-18 | Paper |
XML compression via directed acyclic graphs Theory of Computing Systems | 2016-04-18 | Paper |
Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints Journal of Computer and System Sciences | 2016-04-18 | Paper |
Grammar-Based Tree Compression Developments in Language Theory | 2015-11-10 | Paper |
Path checking for MTL and TPTL over data words Lecture Notes in Computer Science | 2015-11-10 | Paper |