Similar Items: The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
- Computing Planar Convex Hulls with a Promise
- Upward-Planar Drawings with Bounded Span
- Convex Optimization with Nested Evolving Feasible Sets
- Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
- Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model