@InProceedings{chattopadhyay_et_al:LIPIcs.MFCS.2023.34,
author = {Chattopadhyay, Arkadev and Dahiya, Yogesh and Mahajan, Meena},
title = {{Query Complexity of Search Problems}},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-292-1},
ISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.34},
URN = {urn:nbn:de:0030-drops-185689},
doi = {10.4230/LIPIcs.MFCS.2023.34},
annote = {Keywords: Decision trees, Search problems, Pseudo-determinism, Randomness}
}