scientific article; zbMATH DE number 1962853

MaRDI QIDQ4418690zbMATH OpenFDO

Authors Henrik Björklund, Sven Sandberg, Sergei Vorobyov

Publication date 11 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070663.htm

Mathematics Subject Classification ID

Randomized algorithms (68W20) Games involving graphs (91A43)

Recommendations

• A Deterministic Subexponential Algorithm for Solving Parity Games
• A randomized subexponential algorithm for parity games
• Parameterized Algorithms for Parity Games
• The fixpoint-iteration algorithm for parity games
• A recursive approach to solving parity games in quasipolynomial time
• Algorithms for Parity Games
• scientific article; zbMATH DE number 1670778
• Algorithms for solving parity games
• A subexponential lower bound for the random facet algorithm for parity games

Cited in

(31)

• Parity game reductions
• Memoryless determinacy of parity and mean payoff games: a simple proof
• Robust worst cases for parity games algorithms
• A randomized subexponential algorithm for parity games
• Random sampling in computational algebra: Helly numbers and violator spaces
• Parameterized Algorithms for Parity Games
• scientific article; zbMATH DE number 6490915 (Why is no real title available?)
• Helly’s theorem: New variations and applications
• Recursive algorithm for parity games requires exponential time
• Graph Games and Reactive Synthesis
• scientific article; zbMATH DE number 7445162 (Why is no real title available?)
• A Deterministic Subexponential Algorithm for Solving Parity Games
• Removing degeneracy may require unbounded dimension increase
• A CSP-Based Approach for Solving Parity Game
• The Stevens-Stirling-algorithm for solving parity games locally requires exponential time
• Solving μ-Calculus Parity Games by Symbolic Planning
• Alternating traps in Muller and parity games
• A survey of stochastic -regular games
• Solving parity games by a reduction to SAT
• Algorithms for Parity Games
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• A subexponential lower bound for the random facet algorithm for parity games
• An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
• Beyond value iteration for parity games: strategy iteration with universal trees
• Combinatorial structure and randomized subexponential algorithms for infinite games
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
• Graph operations on parity games and polynomial-time algorithms
• Unique sink orientations of grids
• Violator spaces: Structure and algorithms
• Cyclic games and linear programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418690)