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


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