scientific article; zbMATH DE number 7297840

zbMath1457.68125arXiv1702.05051MaRDI QIDQ5144638

Ranko Lazić, Marcin Jurdziński

Publication date: 19 January 2021

Full work available at URL: https://arxiv.org/abs/1702.05051

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43)

Related Items (30)

The Theory of Universal Graphs for Infinite Duration Games ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Finite-state strategies in delay games ⋮ Robust worst cases for parity games algorithms ⋮ Universal algorithms for parity games and nested fixpoints ⋮ Improved complexity analysis of quasi-polynomial algorithms solving parity games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems ⋮ Solving parity games via priority promotion ⋮ Solving Mean-Payoff Games via Quasi Dominions ⋮ New deterministic algorithms for solving parity games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improving parity games in practice ⋮ Quasipolynomial computation of nested fixpoints ⋮ Unnamed Item ⋮ Synthesizing optimally resilient controllers ⋮ Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games ⋮ Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time ⋮ On the Way to Alternating Weak Automata ⋮ Bounded game-theoretic semantics for modal mu-calculus

This page was built for publication: