No. Title Author Year
1 Existential Definability over the Subword Ordering Baumann, Pascal et al. 2022
2 Reachability in Bidirected Pushdown VASS Ganardi, Moses et al. 2022
3 A Characterization of Wreath Products Where Knapsack Is Decidable Bergsträßer, Pascal et al. 2021
4 Compression by Contracting Straight-Line Programs Ganardi, Moses 2021
5 Automatic Equivalence Structures of Polynomial Growth Ganardi, Moses et al. 2020
6 The Complexity of Knapsack Problems in Wreath Products Figelius, Michael et al. 2020
7 Sliding Window Property Testing for Regular Languages Ganardi, Moses et al. 2019
8 Visibly Pushdown Languages over Sliding Windows Ganardi, Moses 2019
9 Automata Theory on Sliding Windows Ganardi, Moses et al. 2018
10 Knapsack Problems for Wreath Products Ganardi, Moses et al. 2018
11 Randomized Sliding Window Algorithms for Regular Languages Ganardi, Moses et al. 2018
12 Sliding Windows over Context-Free Languages Ganardi, Moses et al. 2018
13 Circuit Evaluation for Finite Semirings Ganardi, Moses et al. 2017
14 On the Parallel Complexity of Bisimulation on Finite Systems Ganardi, Moses et al. 2016
15 Querying Regular Languages over Sliding Windows Ganardi, Moses et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 15


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI