Go to the corresponding Portal 
pdfformat: 

@InProceedings{cai_et_al:LIPIcs:2011:3226, author = {Yang Cai and Ting Zhang}, title = {{Tight Upper Bounds for Streett and Parity Complementation}}, booktitle = {Computer Science Logic (CSL'11)  25th International Workshop/20th Annual Conference of the EACSL}, pages = {112128}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897323}, ISSN = {18688969}, year = {2011}, volume = {12}, editor = {Marc Bezem}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3226}, URN = {urn:nbn:de:0030drops32269}, doi = {http://dx.doi.org/10.4230/LIPIcs.CSL.2011.112}, annote = {Keywords: Streett automata, omegaautomata, parity automata, complementation, upper bounds} }
Keywords:  Streett automata, omegaautomata, parity automata, complementation, upper bounds  
Seminar:  Computer Science Logic (CSL'11)  25th International Workshop/20th Annual Conference of the EACSL  
Issue Date:  2011  
Date of publication:  31.08.2011 