No. Title Author Year
1 A Characterization of Wreath Products Where Knapsack Is Decidable Bergsträßer, Pascal et al. 2021
2 Scope-Bounded Reachability in Valence Systems Shetty, Aneesh K. et al. 2021
3 Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups Lohrey, Markus et al. 2020
4 Rational Subsets of Baumslag-Solitar Groups Cadilhac, Michaël et al. 2020
5 The Complexity of Bounded Context Switching with Dynamic Thread Creation Baumann, Pascal et al. 2020
6 The Complexity of Knapsack Problems in Wreath Products Figelius, Michael et al. 2020
7 Regular Separability and Intersection Emptiness Are Independent Problems Thinniyam, Ramanathan S. et al. 2019
8 Bounded Context Switching for Valence Systems Meyer, Roland et al. 2018
9 Knapsack Problems for Wreath Products Ganardi, Moses et al. 2018
10 Unboundedness Problems for Languages of Vector Addition Systems Czerwinski, Wojciech et al. 2018
11 The Complexity of Knapsack in Graph Groups Lohrey, Markus et al. 2017
12 Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products Lohrey, Markus et al. 2016
13 The Complexity of Downward Closure Comparisons Zetzsche, Georg 2016
14 Computing Downward Closures for Stacked Counter Automata Zetzsche, Georg 2015
15 On Boolean closed full trios and rational Kripke frames Lohrey, Markus et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 15


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