A modal μ perspective on solving parity games in quasi-polynomial time

Karoliina Lehtinen. A modal μ perspective on solving parity games in quasi-polynomial time. In Anuj Dawar, Erich Grädel, editors, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. pages 639-648, ACM, 2018. [doi]

@inproceedings{Lehtinen18,
  title = {A modal μ perspective on solving parity games in quasi-polynomial time},
  author = {Karoliina Lehtinen},
  year = {2018},
  doi = {10.1145/3209108.3209115},
  url = {http://doi.acm.org/10.1145/3209108.3209115},
  researchr = {https://researchr.org/publication/Lehtinen18},
  cites = {0},
  citedby = {0},
  pages = {639-648},
  booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018},
  editor = {Anuj Dawar and Erich Grädel},
  publisher = {ACM},
}