Similar Items: Convex Optimization with Nested Evolving Feasible Sets
- The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
- Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
- Chasing Small Sets Optimally Against Adaptive Adversaries
- Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
- On (In)approximability of MaxMin Independent Set Reconfiguration
- Smallest suffixient set maintenance in near-real-time