Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1097.91020OpenAlexW2488008928MaRDI QIDQ5311140

Sven Sandberg, Sergei Vorobyov, Henrik Björklund

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99679

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Randomized algorithms (68W20)

Related Items (9)

Graph Games and Reactive Synthesis ⋮ Temporal Specifications with Accumulative Values ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ Solving mean-payoff games via quasi dominions ⋮ Unique sink orientations of grids ⋮ Solving Mean-Payoff Games via Quasi Dominions ⋮ A policy iteration algorithm for zero-sum stochastic games with mean payoff ⋮ Combinatorial structure and randomized subexponential algorithms for infinite games

This page was built for publication: Mathematical Foundations of Computer Science 2004