@inproceedings{thejaswini_et_al:LIPIcs.FSTTCS.2022.44,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Parity games, Attractor decomposition, Quasipolynomial Algorithms, Universal trees},
Author = {Thejaswini, K. S. and Ohlmann, Pierre and Jurdzi\'{n}ski, Marcin},
BookTitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)},
Editor = {Dawar, Anuj and Guruswami, Venkatesan},
File = {A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games - LIPIcs-FSTTCS-2022-44 - a.pdf},
ISBN = {978-3-95977-261-7},
ISSN = {1868-8969},
Pages = {44:1--44:20},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17436},
Volume = {250},
Year = {2022},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2022/17436},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.FSTTCS.2022.44},
date-added = {2023-01-11 08:12:52 +0100},
date-modified = {2023-01-11 08:12:52 +0100},
urn = {urn:nbn:de:0030-drops-174365},
doi = {10.4230/LIPIcs.FSTTCS.2022.44}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A