-
Unboundedness problems for machines with reversal-bounded counters
Accepted for FoSSaCS 2023
-
Context-Bounded Verification of Context-Free Specifications
Accepted for POPL 2023
-
Low-Latency Sliding Window Algorithms for Formal Languages
Proceedings of FSTTCS 2022
-
The complexity of bidirected reachability in valence systems
Proceedings of LICS 2022
-
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Proceedings of LICS 2022
-
Reachability in Bidirected Pushdown VASS
Proceedings of ICALP 2022
-
Existential Definability over the Subword Ordering
Proceedings of STACS 2022
-
Pattern Matching on Grammar-Compressed Strings in Linear Time
Proceedings of SODA 2022
-
Compression by Contracting Straight-Line Programs
Proceedings of ESA 2021
-
A Characterization of Wreath Products Where Knapsack Is Decidable
Proceedings of STACS 2021
-
The complexity of knapsack problems in wreath products
Proceedings of ICALP 2020
-
Automatic equivalence structures of polynomial growth
Proceedings of CSL 2020
-
Sliding window property testing for regular languages
Proceedings of ISAAC 2019
-
Balancing straight-line programs
Proceedings of FOCS 2019
-
Derandomization of sliding window algorithms with strict correctness
Proceedings of CSR 2019
-
Visibly pushdown languages over sliding windows
Proceedings of STACS 2019
-
Sliding windows over context-free languages
Proceedings of MFCS 2018
-
Randomized sliding window algorithms for regular languages
Proceedings of ICALP 2018
-
Knapsack problems for wreath products
Proceedings of STACS 2018
-
Automata theory on sliding windows
Proceedings of STACS 2018
-
Circuit Evaluation for Finite Semirings
Proceedings of STACS 2017
-
Querying regular languages over sliding-windows
Proceedings of FSTTCS 2016
-
On the Parallel Complexity of Bisimulation on Finite Systems
Proceedings of CSL 2016
-
Tree Compression Using String Grammars
Proceedings of LATIN 2016
-
Parity Games of Bounded Tree-Width and Clique-Width
Proceedings of FoSSaCS 2015
-
Balancing Straight-Line Programs
Journal of the ACM 68(4), 2021
-
Derandomization for Sliding Window Algorithms with Strict Correctness
Theory of Computing Systems 65, pp. 1-18, 2021
-
Universal tree source coding using grammar-based compression
IEEE Transactions on Information Theory 65(10), pp. 6399-6413, 2019
-
The complexity of bisimulation and simulation on finite systems
Logical Methods in Computer Science 14(4), 2018
Special Issue for CSL 2016
-
A universal tree balancing theorem
ACM Transactions on Computation Theory 11(1), Article No. 1, 2019
-
Circuits and expressions over finite semirings
ACM Transactions on Computation Theory 10(4), Article No. 15, 2018
-
Tree compression using string grammars
Algorithmica 80(3), pp. 885–917, 2018
Special Issue for LATIN 2016
-
Constructing small tree grammars and small circuits for formulas
Journal of Computer and System Sciences 86, pp. 136–158, 2017