Arnold Beckmann, Faron Moller. On the Complexity of Parity Games. In Erol Gelenbe, Samson Abramsky, Vladimiro Sassone, editors, Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008. pages 237-248, British Computer Society, 2008. [doi]
@inproceedings{BeckmannM08-0,
title = {On the Complexity of Parity Games},
author = {Arnold Beckmann and Faron Moller},
year = {2008},
url = {http://www.bcs.org/server.php?show=ConWebDoc.22905},
researchr = {https://researchr.org/publication/BeckmannM08-0},
cites = {0},
citedby = {0},
pages = {237-248},
booktitle = {Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008},
editor = {Erol Gelenbe and Samson Abramsky and Vladimiro Sassone},
publisher = {British Computer Society},
}