Optimal LCA and Sublinear Estimation for Bipartite Matching in delta O(1/epsilon) Queries
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-04
Code: https://github.com/openai/math
Terminology
Sources
- Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints
- Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
- Local Computation Algorithms for Maximum Matching: New Lower Bounds
- Distributed Half-Integral Matching and Beyond
- Local Computation of Maximal Independent Set
- Nearly optimal Bernoulli factories for linear functions
- Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations
- A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
- An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series
- Fast Local Computation Algorithms
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time