No. Title Author Year
1 Unboundedness for Recursion Schemes: A Simpler Type System Barozzini, David et al. 2022
2 A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation Arnold, André et al. 2021
3 Higher-Order Model Checking Step by Step Parys, Paweł 2021
4 Cost Automata, Safe Schemes, and Downward Closures Barozzini, David et al. 2020
5 Higher-Order Nonemptiness Step by Step Parys, Paweł 2020
6 Parity Games: Another View on Lehtinen’s Algorithm Parys, Paweł 2020
7 Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time Parys, Pawel 2019
8 Homogeneity Without Loss of Generality Parys, Pawel 2018
9 Recursion Schemes and the WMSO+U Logic Parys, Pawel 2018
10 The Complexity of the Diagonal Problem for Recursion Schemes Parys, Pawel 2018
11 Models of Lambda-Calculus and the Weak MSO Logic Parys, Pawel et al. 2016
12 On a Fragment of AMSO and Tiling Systems Blumensath, Achim et al. 2016
13 Reasoning About Integrity Constraints for Tree-Structured Data Czerwinski, Wojciech et al. 2016
14 The MSO+U Theory of (N,<) Is Undecidable Bojanczyk, Mikolaj et al. 2016
15 Ordered Tree-Pushdown Systems Clemente, Lorenzo et al. 2015
16 A Pumping Lemma for Pushdown Graphs of Any Level Parys, Pawel 2012
17 Decidable classes of documents for XPath Bárány, Vince et al. 2012
18 Variants of Collapsible Pushdown Systems Parys, Pawel 2012
19 Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata Parys, Pawel 2011
Current Page :
Number of result pages: 1
Number of documents: 19

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