pdfformat: 

@InProceedings{arnold_et_al:LIPIcs:2021:13443, author = {Andr{\'e} Arnold and Damian Niwiński and Pawe{\l} Parys}, title = {{A QuasiPolynomial BlackBox Algorithm for Fixed Point Evaluation}}, booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)}, pages = {9:19:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771757}, ISSN = {18688969}, year = {2021}, volume = {183}, editor = {Christel Baier and Jean GoubaultLarrecq}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13443}, URN = {urn:nbn:de:0030drops134430}, doi = {10.4230/LIPIcs.CSL.2021.9}, annote = {Keywords: Mucalculus, Parity games, Quasipolynomial time, Blackbox algorithm} }
Keywords:  Mucalculus, Parity games, Quasipolynomial time, Blackbox algorithm  
Seminar:  29th EACSL Annual Conference on Computer Science Logic (CSL 2021)  
Issue date:  2021  
Date of publication:  13.01.2021 