Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal. A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
@inproceedings{GavinskyLSS19,
title = {A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity},
author = {Dmitry Gavinsky and Troy Lee and Miklos Santha and Swagato Sanyal},
year = {2019},
doi = {10.4230/LIPIcs.ICALP.2019.64},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.64},
researchr = {https://researchr.org/publication/GavinskyLSS19},
cites = {0},
citedby = {0},
booktitle = {46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece},
editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
volume = {132},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-109-2},
}