@InProceedings{radhakrishnan_et_al:LIPIcs.FSTTCS.2016.16,
author = {Radhakrishnan, Jaikumar and Sanyal, Swagato},
title = {{The Zero-Error Randomized Query Complexity of the Pointer Function}},
booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
pages = {16:1--16:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-027-9},
ISSN = {1868-8969},
year = {2016},
volume = {65},
editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.16},
URN = {urn:nbn:de:0030-drops-68514},
doi = {10.4230/LIPIcs.FSTTCS.2016.16},
annote = {Keywords: Deterministic Decision Tree, Randomized Decision Tree, Query Complexity, Models of Computation.}
}