Author:
Kapralov Michael,Mitrović Slobodan,Norouzi-Fard Ashkan,Tardos Jakab
Publisher
Society for Industrial and Applied Mathematics
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Approximating Maximum Matching Requires Almost Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Improved Bounds for Matching in Random-Order Streams;Theory of Computing Systems;2023-12-12
3. Local Computation Algorithms for Maximum Matching: New Lower Bounds;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06