Similar Items: Solving Hypergraph Laplacian Systems in Almost-Linear Time
- Solving Positive Linear Programs with Differential Privacy
- Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
- Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth