The following pages link to Computer Aided Verification (Q5900672):
Displaying 23 items.
- Solving parity games in big steps (Q340584) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Alternating traps in Muller and parity games (Q389948) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Solving Parity Games in Big Steps (Q5458856) (← links)
