Author:
Fakcharoenphol Jittat,Rao Satish,Talwar Kunal
Cited by
111 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Settling Time vs. Accuracy Tradeoffs for Clustering Big Data;Proceedings of the ACM on Management of Data;2024-05-29
2. Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s Algorithm;Lecture Notes on Data Engineering and Communications Technologies;2024
3. Optimal Oblivious Routing With Concave Objectives for Structured Networks;IEEE/ACM Transactions on Networking;2023-12
4. “Intelligent Heuristics Are the Future of Computing”;ACM Transactions on Intelligent Systems and Technology;2023-11-14
5. One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06