From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “PSPACE complexity” 11

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Computational complexity of problems in robust, bilevel and online optimization
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

0

citations
The Complexity of Online Graph Games
2022 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Janosch Fuchs, Christoph Grüne, Tom Janßen

0

citations
The Complexity of Graph Exploration Games
2023 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Janosch Fuchs, Christoph Grüne, Tom Janßen

1

citations
The Complexity of Online Graph Games
2024 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research

Janosch Fuchs, Christoph Grüne, Tom Janßen

2

citations
The Complexity of Graph Exploration Games
2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Janosch Fuchs, Christoph Grüne, Tom Janßen

0

citations
On Bounded Advice Classes
2024 arXiv (Cornell University) preprint Computer Science Computability, Logic, AI Algorithms Open access

Casper Gyurik, Vedran Dunjko

0

citations
Stochastic Games with Lexicographic Reachability-Safety Objectives
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler

20

citations
Finite-valued Streaming String Transducers
2025 TheoretiCS article Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Anca Muscholl, Gabriele Puppis, Sarah Winter

2

citations
A Hyperlogic for Strategies in Stochastic Games (Extended Version)
2025 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

0

citations
Timeline-based planning over dense temporal domains
2020 Theoretical Computer Science article Computer Science AI-based Problem Solving and Planning Open access

Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger

6

citations
Coloring Reconfiguration Under Color Swapping
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

0

citations

11 results