On the public citation graph

Complexity Bounds for Regular Games

https://doi.org/10.1007/11549345_43
0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-36379-3_24openalex-snapshot
Complexity of Some Infinite Games Played on Finite Graphs
inferredcites →https://doi.org/10.1007/3-540-36387-4openalex-snapshot
Automata logics, and infinite games: a guide to current research
inferredcites →https://doi.org/10.1007/3-540-47813-2_17openalex-snapshot
Weak Muller Acceptance Conditions for Tree Automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_7openalex-snapshot
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
inferredcites →https://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferredcites →https://doi.org/10.1016/0168-0072(93)90036-dopenalex-snapshot
Infinite games played on finite graphs
inferredcites →https://doi.org/10.1016/0168-0072(95)00032-1openalex-snapshot
McNaughton games and extracting strategies for concurrent programs
inferredcites →https://doi.org/10.1016/s0304-3975(98)00009-7openalex-snapshot
Infinite games on finitely coloured graphs with applications to automata on infinite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0280205-0openalex-snapshot
Solving sequential conditions by finite-state strategies
inferredcites →https://doi.org/10.1109/lics.1997.614939openalex-snapshot
How much memory is needed to win infinite games?
inferredcites →https://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_1openalex-snapshot
Inherent Size Blowup in $$\omega $$ -Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_12openalex-snapshot
Zielonka DAG Acceptance and Regular Languages over Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_11openalex-snapshot
Checking History-Determinism is NP-hard for Parity Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_4openalex-snapshot
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_6openalex-snapshot
Games with Weighted Multiple Objectives
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_15openalex-snapshot
Non-Zero-Sum Games with Multiple Weighted Objectives
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_1openalex-snapshot
Computer Aided Synthesis: A Game-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_36openalex-snapshot
Stochastic Müller Games are PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_18openalex-snapshot
On Reachability Games of Ordinal Length
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_25openalex-snapshot
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_37openalex-snapshot
Decision Problems for Nash Equilibria in Stochastic Games
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_17openalex-snapshot
On Müller Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_15openalex-snapshot
Extracting Winning Strategies in Update Games
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_20openalex-snapshot
Concurrent Games with Ordered Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_39openalex-snapshot
Strategy Machines and Their Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_25openalex-snapshot
Strategy Composition in Compositional Games
inferred← citeshttps://doi.org/10.1007/s00236-016-0273-2openalex-snapshot
Assume-admissible synthesis
inferred← citeshttps://doi.org/10.1016/j.ic.2011.11.004openalex-snapshot
The complexity of stochastic Müller games
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.002openalex-snapshot
A survey of stochastic ω-regular games
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.012openalex-snapshot
On Müller context-free grammars
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470597openalex-snapshot
Responsibility and verification: Importance value in temporal logics
inferred← citeshttps://doi.org/10.1137/17m1145288openalex-snapshot
Deciding Parity Games in Quasi-polynomial Time
inferred← citeshttps://doi.org/10.1142/9789811278631_0016openalex-snapshot
Weak Muller Conditions Make Delay Games Hard
inferred← citeshttps://doi.org/10.1145/3717823.3718310openalex-snapshot
The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:20)2011openalex-snapshot
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
inferred← citeshttps://doi.org/10.29007/c3bjopenalex-snapshot
Why These Automata Types?
inferred← citeshttps://doi.org/10.4204/eptcs.428.6openalex-snapshot
The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
inferred← citeshttps://doi.org/10.4230/lipics.concur.2018.29openalex-snapshot
Parameterized complexity of games with monotonically ordered omega-regular objectives
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1756openalex-snapshot
Explicit Muller Games are PTIME
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.123openalex-snapshot
Optimal Transformations of Muller Conditions
inferred← citeshttps://doi.org/10.46298/theoretics.24.12openalex-snapshot
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
inferred← citeshttps://doi.org/10.48456/tr-704openalex-snapshot
Complexity and infinite games on finite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2305.10546openalex-snapshot
Games on Graphs: From Logic and Automata to Algorithms
inferred← citeshttps://doi.org/10.70675/651d709ez844dz4875z8ce4z4aaa692837eaopenalex-snapshot
Synthesis of Interactive Reactive Systems
inferred← citeshttps://doi.org/10.70675/660020c0z10a3z4b40zac0ez5871de2a15ecopenalex-snapshot
Structural properties of automata over infinite words and memory for games
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.