Small Progress Measures for Solving Parity Games
By Marcin Jurdzinski. Symposium on Theoretical Aspects of Computer Science, 2000
469 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Software
View Paper: https://www.semanticscholar.org/paper/c896b4b44f7e1729182ac89a50a352468052472f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Nir Piterman
- Jens Vöge
- Krishnendu Chatterjee
- Thomas A. Henzinger
- Yaniv Sa'ar
- Amir Pnueli
- Barbara Jobstmann
- Roderick Bloem
In Computational Theory and Mathematics
- Nir Piterman
- Jens Vöge
- Krishnendu Chatterjee
- Thomas A. Henzinger
- Yaniv Sa'ar
- Amir Pnueli
- Barbara Jobstmann
- Roderick Bloem
In Software
- Nir Piterman
- Jens Vöge
- Krishnendu Chatterjee
- Thomas A. Henzinger
- Yaniv Sa'ar
- Amir Pnueli
- Barbara Jobstmann
- Roderick Bloem
Citations in the corpus
- A Discrete Strategy Improvement Algorithm for Solving Parity Games (2000, methodology): “or O ( (n/d)d/2 ) worst-case running time bounds (see [10] and references therein), where d is the number of different priorities assigned to vertices.”
- Synthesis of Reactive(1) designs (2006, background): “For both types of fixpoints, the loop terminates if two successive values of u are the same.”
- Strategy logic (2007, methodology): “By applying an algorithm for solving parity games [Jur00] and a polynomial-time algorithm for model checking Streett conditions, we obtain the desired upper bound.”