research
∙
09/12/2023
An improved protocol for ExactlyN with more than 3 players
The ExactlyN problem in the number-on-forehead (NOF) communication setti...
share
research
∙
11/30/2022
Lifting to Parity Decision Trees Via Stifling
We show that the deterministic decision tree complexity of a (partial) f...
research
∙
12/02/2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness
We study the complexity of optimizing highly smooth convex functions. Fo...
research
∙
10/05/2020
No quantum speedup over gradient descent for non-smooth convex optimization
We study the first-order convex optimization problem, where we have blac...
research
∙
09/06/2020