@InProceedings{mande_et_al:LIPIcs.FSTTCS.2023.30,
author = {Mande, Nikhil S. and Paraashar, Manaswi and Saurabh, Nitin},
title = {{Randomized and Quantum Query Complexities of Finding a King in a Tournament}},
booktitle = {43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)},
pages = {30:1--30:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-304-1},
ISSN = {1868-8969},
year = {2023},
volume = {284},
editor = {Bouyer, Patricia and Srinivasan, Srikanth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.30},
URN = {urn:nbn:de:0030-drops-194039},
doi = {10.4230/LIPIcs.FSTTCS.2023.30},
annote = {Keywords: Query complexity, quantum computing, randomized query complexity, tournament solutions, search problems}
}