@inproceedings{Allred:2018:SOC:3209108.3209138,
    Address = {New York, NY, USA},
    Author = {Allred, Joel D. and Ultes-Nitsche, Ulrich},
    BookTitle = {Proc. of LICS'18},
    File = {Buchi-complementation (0) - a - a - t.pdf},
    ISBN = {978-1-4503-5583-4},
    Keywords = {B\"{u}chi Automaton, Benchmarking, Complementation, Optimal Upper Bound},
    Location = {Oxford, United Kingdom},
    Pages = {46--55},
    Publisher = {ACM},
    Series = {LICS '18},
    Title = {A Simple and Optimal Complementation Algorithm for B\"{u}chi Automata},
    URL = {http://doi.acm.org/10.1145/3209108.3209138},
    Year = {2018},
    acmid = {3209138},
    bdsk-url-1 = {http://doi.acm.org/10.1145/3209108.3209138},
    bdsk-url-2 = {https://doi.org/10.1145/3209108.3209138},
    date-added = {2019-04-24 12:33:03 +0200},
    date-modified = {2019-05-17 21:21:22 +0200},
    file-2 = {proceedings\_paper\_664 (0) (0) - a - a - t.pdf},
    numpages = {10},
    doi = {10.1145/3209108.3209138}
}

@inproceedings{Allred:2018:SOC:3209108.3209138, Address = {New York, NY, USA}, Author = {Allred, Joel D. and Ultes-Nitsche, Ulrich}, BookTitle = {Proc. of LICS'18}, File = {Buchi-complementation (0) - a - a - t.pdf}, ISBN = {978-1-4503-5583-4}, Keywords = {B\"{u}chi Automaton, Benchmarking, Complementation, Optimal Upper Bound}, Location = {Oxford, United Kingdom}, Pages = {46--55}, Publisher = {ACM}, Series = {LICS '18}, Title = {A Simple and Optimal Complementation Algorithm for B\"{u}chi Automata}, URL = {http://doi.acm.org/10.1145/3209108.3209138}, Year = {2018}, acmid = {3209138}, bdsk-url-1 = {http://doi.acm.org/10.1145/3209108.3209138}, bdsk-url-2 = {https://doi.org/10.1145/3209108.3209138}, date-added = {2019-04-24 12:33:03 +0200}, date-modified = {2019-05-17 21:21:22 +0200}, file-2 = {proceedings_paper_664 (0) (0) - a - a - t.pdf}, numpages = {10}, doi = {10.1145/3209108.3209138} }