Author:
Chaudhuri K.,Daskalakis C.,Kleinberg R. D.,Lin H.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Prophet Inequalities with Cancellation Costs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. A tight bound for shortest augmenting paths on trees;Theoretical Computer Science;2022-01
3. Fully-Dynamic Submodular Cover with Bounded Recourse;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
4. Improved Dynamic Graph Coloring;ACM Transactions on Algorithms;2020-06-26
5. Online Bipartite Matching with Amortized
O
(log
2
n
) Replacements;Journal of the ACM;2019-10-31