| No. |
Title |
Author |
Year |
| 1 |
On the Complexity of Diameter and Related Problems in Permutation Groups |
Lohrey, Markus et al. |
2023 |
| 2 |
Low-Latency Sliding Window Algorithms for Formal Languages |
Ganardi, Moses et al. |
2022 |
| 3 |
Membership Problems in Finite Groups |
Lohrey, Markus et al. |
2022 |
| 4 |
Streaming Word Problems |
Lohrey, Markus et al. |
2022 |
| 5 |
Subgroup Membership in GL(2,Z) |
Lohrey, Markus |
2021 |
| 6 |
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems |
Bartholdi, Laurent et al. |
2020 |
| 7 |
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups |
Lohrey, Markus et al. |
2020 |
| 8 |
The Complexity of Knapsack Problems in Wreath Products |
Figelius, Michael et al. |
2020 |
| 9 |
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131) |
Diekert, Volker et al. |
2019 |
| 10 |
Compressed Decision Problems in Hyperbolic Groups |
Holt, Derek et al. |
2019 |
| 11 |
Sliding Window Property Testing for Regular Languages |
Ganardi, Moses et al. |
2019 |
| 12 |
The Power Word Problem |
Lohrey, Markus et al. |
2019 |
| 13 |
Automata Theory on Sliding Windows |
Ganardi, Moses et al. |
2018 |
| 14 |
Average Case Analysis of Leaf-Centric Binary Tree Sources |
Seelbach Benkner, Louisa et al. |
2018 |
| 15 |
Knapsack Problems for Wreath Products |
Ganardi, Moses et al. |
2018 |
| 16 |
Randomized Sliding Window Algorithms for Regular Languages |
Ganardi, Moses et al. |
2018 |
| 17 |
Sliding Windows over Context-Free Languages |
Ganardi, Moses et al. |
2018 |
| 18 |
Circuit Evaluation for Finite Semirings |
Ganardi, Moses et al. |
2017 |
| 19 |
Compression of Unordered XML Trees |
Lohrey, Markus et al. |
2017 |
| 20 |
Computation over Compressed Structured Data (Dagstuhl Seminar 16431) |
Bille, Philip et al. |
2017 |
| 21 |
Counting Problems for Parikh Images |
Haase, Christoph et al. |
2017 |
| 22 |
The Complexity of Knapsack in Graph Groups |
Lohrey, Markus et al. |
2017 |
| 23 |
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products |
Lohrey, Markus et al. |
2016 |
| 24 |
On the Parallel Complexity of Bisimulation on Finite Systems |
Ganardi, Moses et al. |
2016 |
| 25 |
Querying Regular Languages over Sliding Windows |
Ganardi, Moses et al. |
2016 |
| 26 |
Temporal Logics with Local Constraints (Invited Talk) |
Carapelle, Claudia et al. |
2015 |
| 27 |
Approximation of smallest linear tree grammar |
Jez, Artur et al. |
2014 |
| 28 |
Constructing Small Tree Grammars and Small Circuits for Formulas |
Hucke, Danny et al. |
2014 |
| 29 |
On Boolean closed full trios and rational Kripke frames |
Lohrey, Markus et al. |
2014 |
| 30 |
Compression of Rewriting Systems for Termination Analysis |
Bau, Alexander et al. |
2013 |
| 31 |
The First-Order Theory of Ground Tree Rewrite Graphs |
Göller, Stefan et al. |
2011 |
| 32 |
Branching-time Model Checking of One-counter Processes |
Göller, Stefan et al. |
2010 |
| 33 |
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures |
Downey, Rod et al. |
2008 |
| 34 |
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures |
Downey, Rod et al. |
2008 |
| 35 |
08261 Abstracts Collection -- Structure-Based Compression of Complex Massive Data |
Böttcher, Stefan et al. |
2008 |
| 36 |
08261 Executive Summary -- Structure-Based Compression of Complex Massive Data |
Böttcher, Stefan et al. |
2008 |
| 37 |
Application of verification techniques to inverse monoids |
Lohrey, Markus |
2008 |
| 38 |
Leaf languages and string compression |
Lohrey, Markus |
2008 |
| 39 |
PDL with Intersection and Converse is 2EXP-complete |
Göller, Stefan et al. |
2008 |
