Author:
Bernstein Aaron,Stein Cliff
Publisher
Society for Industrial and Applied Mathematics
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Deterministic Dynamic Matching in Worst-Case Update Time;Algorithmica;2023-08-17
4. Sublinear Algorithms for (1.5+)-Approximate Matching;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. On Regularity Lemma and Barriers in Streaming and Dynamic Matching;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02