runtime complexity
- Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games
- Efficient Spectral Control of Partially Observed Linear Dynamical Systems
- Nearly-Linear Time and Massively Parallel Algorithms for $k$-anonymity
- Smoothed Agnostic Learning of Halfspaces over the Hypercube