No. Title Author Year
1 Regular Separability and Intersection Emptiness Are Independent Problems Thinniyam, Ramanathan S. et al. 2019
2 Bounded Context Switching for Valence Systems Meyer, Roland et al. 2018
3 Knapsack Problems for Wreath Products Ganardi, Moses et al. 2018
4 Unboundedness Problems for Languages of Vector Addition Systems Czerwinski, Wojciech et al. 2018
5 The Complexity of Knapsack in Graph Groups Lohrey, Markus et al. 2017
6 Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products Lohrey, Markus et al. 2016
7 The Complexity of Downward Closure Comparisons Zetzsche, Georg 2016
8 Computing Downward Closures for Stacked Counter Automata Zetzsche, Georg 2015
9 On Boolean closed full trios and rational Kripke frames Lohrey, Markus et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 9


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