Similar Items: On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
- Accelerated Relax-and-Round for Concave Coverage Problems
- Solving Positive Linear Programs with Differential Privacy
- Solving Hypergraph Laplacian Systems in Almost-Linear Time
- Distributed Santa Claus via Global Rounding
- Towards Settling the Complexity of the Lettericity Problem