No. |
Title |
Author |
Year |
1 |
Automatic Equivalence Structures of Polynomial Growth |
Ganardi, Moses et al. |
2020 |
2 |
The Complexity of Knapsack Problems in Wreath Products |
Figelius, Michael et al. |
2020 |
3 |
Sliding Window Property Testing for Regular Languages |
Ganardi, Moses et al. |
2019 |
4 |
Visibly Pushdown Languages over Sliding Windows |
Ganardi, Moses |
2019 |
5 |
Automata Theory on Sliding Windows |
Ganardi, Moses et al. |
2018 |
6 |
Knapsack Problems for Wreath Products |
Ganardi, Moses et al. |
2018 |
7 |
Randomized Sliding Window Algorithms for Regular Languages |
Ganardi, Moses et al. |
2018 |
8 |
Sliding Windows over Context-Free Languages |
Ganardi, Moses et al. |
2018 |
9 |
Circuit Evaluation for Finite Semirings |
Ganardi, Moses et al. |
2017 |
10 |
On the Parallel Complexity of Bisimulation on Finite Systems |
Ganardi, Moses et al. |
2016 |
11 |
Querying Regular Languages over Sliding Windows |
Ganardi, Moses et al. |
2016 |