Funder
Alfred P. Sloan Foundation
Microsoft Research
David Morgenthaler II Faculty Fellowship
Division of Computing and Communication Foundations
Cited by
102 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Nearly Optimal Fault Tolerant Distance Oracle;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. (1 −
)-Approximation of Knapsack in Nearly Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. $$(\min ,+)$$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences;Lecture Notes in Computer Science;2023-12-09
5. A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06