research
∙
06/21/2023
Memory-Query Tradeoffs for Randomized Convex Optimization
We show that any randomized first-order algorithm which minimizes a d-di...
share
research
∙
11/09/2022
Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window)
Dynamic algorithms come in three main flavors: 𝑖𝑛𝑐𝑟𝑒𝑚𝑒𝑛𝑡𝑎𝑙 (insertions-o...
research
∙
04/19/2019
Tight Bounds for Online Edge Coloring
Vizing's celebrated theorem asserts that any graph of maximum degree Δ a...
research
∙
10/18/2018
