Author of the publication

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

The log-approximate-rank conjecture is false., , and . STOC, page 42-53. ACM, (2019)Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness., , , and . NeurIPS, page 29874-29884. (2021)No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization., , , and . ITCS, volume 185 of LIPIcs, page 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)An Improved Protocol for ExactlyN with More Than 3 Players., , , , and . ITCS, volume 287 of LIPIcs, page 58:1-58:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Lifting to Parity Decision Trees via Stifling., , , and . ITCS, volume 251 of LIPIcs, page 33:1-33:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture., , and . FSTTCS, volume 213 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)One-Way Communication Complexity and Non-Adaptive Decision Trees., , and . STACS, volume 219 of LIPIcs, page 49:1-49:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)