The Theory of Universal Graphs for Infinite Duration Games (Q5043588): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.46298/lmcs-18(3:29)2022 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasipolynomial Set-Based Symbolic Algorithms for Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bridge Between Regular Cost Functions and Omega-Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and good for games automata: new tools for infinite duration games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for Components and Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding parity games in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Stabilisation Monoids and Regular Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pseudo-quasi-polynomial algorithm for mean-payoff parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity and Streett Games with Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Games Without Determinization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, the simplex algorithm and simple polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Half-Positional Determinacy of Infinite Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5114824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal μ perspective on solving parity games in quasi-polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Universal Graphs for Infinite Duration Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5079761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of multi-mean-payoff and multi-energy games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.46298/LMCS-18(3:29)2022 / rank
 
Normal rank

Latest revision as of 15:42, 30 December 2024

scientific article; zbMATH DE number 7596577
Language Label Description Also known as
English
The Theory of Universal Graphs for Infinite Duration Games
scientific article; zbMATH DE number 7596577

    Statements

    The Theory of Universal Graphs for Infinite Duration Games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2022
    0 references
    games on graphs
    0 references
    parity games
    0 references
    mean payoff games
    0 references
    universal graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers