No. Title Author Year
1 Checking Refinement of Asynchronous Programs Against Context-Free Specifications Baumann, Pascal et al. 2023
2 Context-Bounded Analysis of Concurrent Programs (Invited Talk) Baumann, Pascal et al. 2023
3 Monus Semantics in Vector Addition Systems with States Baumann, Pascal et al. 2023
4 Priority Downward Closures Anand, Ashwani et al. 2023
5 Regular Separability in Büchi VASS Baumann, Pascal et al. 2023
6 Existential Definability over the Subword Ordering Baumann, Pascal et al. 2022
7 Membership Problems in Finite Groups Lohrey, Markus et al. 2022
8 Reachability in Bidirected Pushdown VASS Ganardi, Moses et al. 2022
9 A Characterization of Wreath Products Where Knapsack Is Decidable Bergsträßer, Pascal et al. 2021
10 Scope-Bounded Reachability in Valence Systems Shetty, Aneesh K. et al. 2021
11 Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups Lohrey, Markus et al. 2020
12 Rational Subsets of Baumslag-Solitar Groups Cadilhac, Michaël et al. 2020
13 The Complexity of Bounded Context Switching with Dynamic Thread Creation Baumann, Pascal et al. 2020
14 The Complexity of Knapsack Problems in Wreath Products Figelius, Michael et al. 2020
15 Regular Separability and Intersection Emptiness Are Independent Problems Thinniyam, Ramanathan S. et al. 2019
16 Bounded Context Switching for Valence Systems Meyer, Roland et al. 2018
17 Knapsack Problems for Wreath Products Ganardi, Moses et al. 2018
18 Unboundedness Problems for Languages of Vector Addition Systems Czerwinski, Wojciech et al. 2018
19 The Complexity of Knapsack in Graph Groups Lohrey, Markus et al. 2017
20 Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products Lohrey, Markus et al. 2016
21 The Complexity of Downward Closure Comparisons Zetzsche, Georg 2016
22 Computing Downward Closures for Stacked Counter Automata Zetzsche, Georg 2015
23 On Boolean closed full trios and rational Kripke frames Lohrey, Markus et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 23

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