Author of the publication

The Deterministic and Randomized Query Complexity of a Simple Guessing Game.

, , , , , and . Electron. Colloquium Comput. Complex., (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds., , and . STOC, page 978-989. ACM, (2018)Lower Bounds for Oblivious Near-Neighbor Search., , , and . SODA, page 1116-1134. SIAM, (2020)Lower Bounds for Oblivious Data Structures., , and . SODA, page 2439-2447. SIAM, (2019)Faster Online Matrix-Vector Multiplication., and . SODA, page 2182-2189. SIAM, (2017)Super-Logarithmic Lower Bounds for Dynamic Graph Problems., and . FOCS, page 1589-1604. IEEE, (2023)Improved range searching lower bounds., and . SCG, page 171-178. ACM, (2012)DecreaseKeys are expensive for external memory priority queues., , and . STOC, page 1081-1093. ACM, (2017)Optimal Minimal Margin Maximization with Boosting., , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 4392-4401. PMLR, (2019)Lower Bounds for Oblivious Near-Neighbor Search., , , and . CoRR, (2019)Towards Tight Lower Bounds for Range Reporting on the RAM., and . ICALP, volume 55 of LIPIcs, page 92:1-92:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)