@InProceedings{mukhopadhyay_et_al:LIPIcs.FSTTCS.2015.206,
author = {Mukhopadhyay, Sagnik and Sanyal, Swagato},
title = {{Towards Better Separation between Deterministic and Randomized Query Complexity}},
booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
pages = {206--220},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-97-2},
ISSN = {1868-8969},
year = {2015},
volume = {45},
editor = {Harsha, Prahladh and Ramalingam, G.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.206},
URN = {urn:nbn:de:0030-drops-56467},
doi = {10.4230/LIPIcs.FSTTCS.2015.206},
annote = {Keywords: Deterministic Decision Tree, Randomized Decision Tree, Query Complexity, Models of Computation.}
}