EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO-Theor. Inf. Appl., 45 4 (2011) 449-457 Article references

Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Priority Promotion with Parysian flair

Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero, Sven Schewe and Dominik Wojtczak
Journal of Computer and System Sciences 147 103580 (2025)
https://doi.org/10.1016/j.jcss.2024.103580

Theoretical Aspects of Computing – ICTAC 2022

Volker Diekert and Manfred Kufleitner
Lecture Notes in Computer Science, Theoretical Aspects of Computing – ICTAC 2022 13572 14 (2022)
https://doi.org/10.1007/978-3-031-17715-6_3

Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games

Luisa D'Amore, Aniello Murano, Loredana Sorrentino, Rossella Arcucci and Giuliano Laccetti
Concurrency and Computation: Practice and Experience 33 (4) (2021)
https://doi.org/10.1002/cpe.6043

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space

John Fearnley, Sanjay Jain, Bart de Keijzer, et al.
International Journal on Software Tools for Technology Transfer 21 (3) 325 (2019)
https://doi.org/10.1007/s10009-019-00509-3

Parallel Parity Games: a Multicore Attractor for the Zielonka Recursive Algorithm

Rossella Arcucci, Umberto Marotta, Aniello Murano and Loredana Sorrentino
Procedia Computer Science 108 525 (2017)
https://doi.org/10.1016/j.procs.2017.05.120

Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games

Massimo Benerecetti, Daniele Dell'Erba and Fabio Mogavero
Electronic Proceedings in Theoretical Computer Science 256 121 (2017)
https://doi.org/10.4204/EPTCS.256.9

Partial Solvers for Parity Games: Effective Polynomial-Time Composition

Patrick Ah-Fat and Michael Huth
Electronic Proceedings in Theoretical Computer Science 226 1 (2016)
https://doi.org/10.4204/EPTCS.226.1

Formal Aspects of Component Software

Antonio Di Stasio, Aniello Murano, Vincenzo Prignano and Loredana Sorrentino
Lecture Notes in Computer Science, Formal Aspects of Component Software 8997 145 (2015)
https://doi.org/10.1007/978-3-319-15317-9_9

Improvement in Small Progress Measures

Maciej Gazda and Tim A.C. Willemse
Electronic Proceedings in Theoretical Computer Science 193 158 (2015)
https://doi.org/10.4204/EPTCS.193.12

The Fixpoint-Iteration Algorithm for Parity Games

Florian Bruse, Michael Falk and Martin Lange
Electronic Proceedings in Theoretical Computer Science 161 116 (2014)
https://doi.org/10.4204/EPTCS.161.12

Parity Games and Propositional Proofs

Arnold Beckmann, Pavel Pudlák and Neil Thapen
ACM Transactions on Computational Logic 15 (2) 1 (2014)
https://doi.org/10.1145/2579822

Mathematical Foundations of Computer Science 2013

Arnold Beckmann, Pavel Pudlák and Neil Thapen
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2013 8087 111 (2013)
https://doi.org/10.1007/978-3-642-40313-2_12

Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds

Maciej Gazda and Tim A.C. Willemse
Electronic Proceedings in Theoretical Computer Science 119 7 (2013)
https://doi.org/10.4204/EPTCS.119.4