Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{thaler:LIPIcs:2016:6313, author = {Justin Thaler}, title = {{Lower Bounds for the Approximate Degree of BlockComposed Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {17:117:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770132}, ISSN = {18688969}, year = {2016}, volume = {55}, editor = {Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6313}, URN = {urn:nbn:de:0030drops63133}, doi = {10.4230/LIPIcs.ICALP.2016.17}, annote = {Keywords: approximate degree, onesided approximate degree, polynomial approx imations, threshold degree, communication complexity} }
Keywords:  approximate degree, onesided approximate degree, polynomial approx imations, threshold degree, communication complexity  
Seminar:  43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)  
Issue Date:  2016  
Date of publication:  17.08.2016 