Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The complexity of stochastic games
Information and Computation
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Model checking
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
How to solve large scale deterministic games with mean payoff by policy iteration
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Cyclic games and linear programming
Discrete Applied Mathematics
Controller Synthesis with Budget Constraints
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
The Beginning of Model Checking: A Personal Perspective
25 Years of Model Checking
25 Years of Model Checking
Precise Interval Analysis vs. Parity Games
FM '08 Proceedings of the 15th international symposium on Formal Methods
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Representing and verifying temporal epistemic properties in multi-agent systems
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Non-oblivious strategy improvement
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Verifying real-time temporal, cooperation and epistemic properties for uncertain agents
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Strategy improvement and randomized subexponential algorithms for stochastic parity games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
Model checking for epistemic and temporal properties of uncertain agents
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Controller synthesis and ordinal automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Concurrency, Compositionality, and Correctness
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Fatal attractors in parity games
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Alternating traps in Muller and parity games
Theoretical Computer Science
| Hi-index | 0.00 |
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms of Kalai and of Matoušek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. Our deterministic algorithm is almost as fast as the randomized algorithms mentioned above.