Go to the corresponding LIPIcs Volume Portal 
Shalev, BenDavid ; Kothari, Robin
pdfformat: 

@InProceedings{shalev_et_al:LIPIcs:2016:6223, author = {BenDavid Shalev and Robin Kothari}, title = {{Randomized Query Complexity of Sabotaged and Composed Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {60:160:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770132}, ISSN = {18688969}, year = {2016}, volume = {55}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6223}, URN = {urn:nbn:de:0030drops62233}, doi = {10.4230/LIPIcs.ICALP.2016.60}, annote = {Keywords: Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem} }
Keywords:  Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem  
Seminar:  43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)  
Issue Date:  2016  
Date of publication:  17.08.2016 