An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. Fearnley, J.; Jain, S.; de Keijzer, B.; Schewe, S.; Stephan, F.; and Wojtczak, D. Int. J. Softw. Tools Technol. Transf., 21(3):325-349, 2019.
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. [link]Link  An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. [link]Paper  bibtex   
@article{journals/sttt/FearnleyJKSSW19,
  added-at = {2020-06-15T00:00:00.000+0200},
  author = {Fearnley, John and Jain, Sanjay and de Keijzer, Bart and Schewe, Sven and Stephan, Frank and Wojtczak, Dominik},
  biburl = {https://www.bibsonomy.org/bibtex/215c527c4dd086fb47a0c4f434f7b3a69/dblp},
  ee = {https://doi.org/10.1007/s10009-019-00509-3},
  interhash = {0e543d3ab4b7b4f4d34498ec986e69a7},
  intrahash = {15c527c4dd086fb47a0c4f434f7b3a69},
  journal = {Int. J. Softw. Tools Technol. Transf.},
  keywords = {dblp},
  number = 3,
  pages = {325-349},
  timestamp = {2020-06-16T11:54:31.000+0200},
  title = {An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space.},
  url = {http://dblp.uni-trier.de/db/journals/sttt/sttt21.html#FearnleyJKSSW19},
  volume = 21,
  year = 2019
}
Downloads: 0