| No. |
Title |
Author |
Year |
| 1 |
Checking Refinement of Asynchronous Programs Against Context-Free Specifications |
Baumann, Pascal et al. |
2023 |
| 2 |
Context-Bounded Analysis of Concurrent Programs (Invited Talk) |
Baumann, Pascal et al. |
2023 |
| 3 |
Existential Definability over the Subword Ordering |
Baumann, Pascal et al. |
2022 |
| 4 |
Low-Latency Sliding Window Algorithms for Formal Languages |
Ganardi, Moses et al. |
2022 |
| 5 |
Reachability in Bidirected Pushdown VASS |
Ganardi, Moses et al. |
2022 |
| 6 |
A Characterization of Wreath Products Where Knapsack Is Decidable |
Bergsträßer, Pascal et al. |
2021 |
| 7 |
Compression by Contracting Straight-Line Programs |
Ganardi, Moses |
2021 |
| 8 |
Automatic Equivalence Structures of Polynomial Growth |
Ganardi, Moses et al. |
2020 |
| 9 |
The Complexity of Knapsack Problems in Wreath Products |
Figelius, Michael et al. |
2020 |
| 10 |
Sliding Window Property Testing for Regular Languages |
Ganardi, Moses et al. |
2019 |
| 11 |
Visibly Pushdown Languages over Sliding Windows |
Ganardi, Moses |
2019 |
| 12 |
Automata Theory on Sliding Windows |
Ganardi, Moses et al. |
2018 |
| 13 |
Knapsack Problems for Wreath Products |
Ganardi, Moses et al. |
2018 |
| 14 |
Randomized Sliding Window Algorithms for Regular Languages |
Ganardi, Moses et al. |
2018 |
| 15 |
Sliding Windows over Context-Free Languages |
Ganardi, Moses et al. |
2018 |
| 16 |
Circuit Evaluation for Finite Semirings |
Ganardi, Moses et al. |
2017 |
| 17 |
On the Parallel Complexity of Bisimulation on Finite Systems |
Ganardi, Moses et al. |
2016 |
| 18 |
Querying Regular Languages over Sliding Windows |
Ganardi, Moses et al. |
2016 |
