Published in: LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Konrad Staniszewski. Parity Games of Bounded Tree-Depth. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 33:1-33:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{staniszewski:LIPIcs.CSL.2023.33, author = {Staniszewski, Konrad}, title = {{Parity Games of Bounded Tree-Depth}}, booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)}, pages = {33:1--33:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-264-8}, ISSN = {1868-8969}, year = {2023}, volume = {252}, editor = {Klin, Bartek and Pimentel, Elaine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.33}, URN = {urn:nbn:de:0030-drops-174942}, doi = {10.4230/LIPIcs.CSL.2023.33}, annote = {Keywords: Parity Games, Circuits, Tree-Depth, Clique-Width} }