Solving Parity Games: Explicit vs Symbolic. Stasio, A. D., Murano, A., & Vardi, M. Y. In Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings, volume 10977, of Lecture Notes in Computer Science, pages 159–172, 2018. Springer.
Solving Parity Games: Explicit vs Symbolic [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/wia/StasioMV18,
  author       = {Antonio Di Stasio and
                  Aniello Murano and
                  Moshe Y. Vardi},
  editor       = {Cezar C{\^{a}}mpeanu},
  title        = {Solving Parity Games: Explicit vs Symbolic},
  booktitle    = {Implementation and Application of Automata - 23rd International Conference,
                  {CIAA} 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10977},
  pages        = {159--172},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-94812-6\_14},
  doi          = {10.1007/978-3-319-94812-6\_14},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wia/StasioMV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0