A constant-factor approximation algorithm for the asymmetric traveling salesman problem O Svensson, J Tarnawski, LA Végh Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 109 | 2018 |
Beyond 1/2-approximation for submodular maximization on massive data streams A Norouzi-Fard, J Tarnawski, S Mitrovic, A Zandieh, A Mousavifar, ... International Conference on Machine Learning, 3829-3838, 2018 | 107 | 2018 |
Fast generation of random spanning trees and the effective resistance metric A Mądry, D Straszak, J Tarnawski Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015 | 82 | 2015 |
Efficient algorithms for device placement of dnn graph operators JM Tarnawski, A Phanishayee, N Devanur, D Mahajan, ... Advances in Neural Information Processing Systems 33, 2020 | 72 | 2020 |
The matching problem in general graphs is in quasi-NC O Svensson, J Tarnawski 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 71 | 2017 |
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach S Mitrović, I Bogunovic, A Norouzi-Fard, J Tarnawski, V Cevher Advances in Neural Information Processing Systems, 4558-4567, 2017 | 61 | 2017 |
Piper: Multidimensional Planner for DNN Parallelization JM Tarnawski, D Narayanan, A Phanishayee Advances in Neural Information Processing Systems 34, 2021 | 59 | 2021 |
Fairness in Streaming Submodular Maximization: Algorithms and Hardness M El Halabi, S Mitrović, A Norouzi-Fard, J Tardos, JM Tarnawski Advances in Neural Information Processing Systems 33, 2020 | 52 | 2020 |
Correlation clustering in constant many parallel rounds V Cohen-Addad, S Lattanzi, S Mitrović, A Norouzi-Fard, N Parotsidis, ... International Conference on Machine Learning, 2069-2078, 2021 | 41 | 2021 |
Fully dynamic algorithm for constrained submodular optimization S Lattanzi, S Mitrović, A Norouzi-Fard, JM Tarnawski, M Zadimoghaddam Advances in Neural Information Processing Systems 33, 12923-12933, 2020 | 27 | 2020 |
Harmony: Overcoming the hurdles of GPU memory capacity to train massive DNN models on commodity servers Y Li, A Phanishayee, D Murray, J Tarnawski, NS Kim arXiv preprint arXiv:2202.01306, 2022 | 24 | 2022 |
Online edge coloring via tree recurrences and correlation decay J Kulkarni, YP Liu, A Sah, M Sawhney, J Tarnawski Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 23 | 2022 |
D\'ej\aVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving F Strati, S Mcallister, A Phanishayee, J Tarnawski, A Klimovic arXiv preprint arXiv:2403.01876, 2024 | 20 | 2024 |
Active learning and proofreading for delineation of curvilinear structures A Mosinska, J Tarnawski, P Fua Medical Image Computing and Computer-Assisted Intervention− MICCAI 2017 …, 2017 | 20 | 2017 |
Scheduling with communication delays via LP hierarchies and clustering S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 19 | 2020 |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints J Kulkarni, S Li, J Tarnawski, M Ye Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 18 | 2020 |
Near-optimal correlation clustering with privacy V Cohen-Addad, C Fan, S Lattanzi, S Mitrovic, A Norouzi-Fard, ... Advances in Neural Information Processing Systems 35, 33702-33715, 2022 | 17 | 2022 |
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 16 | 2021 |
Constant factor approximation for ATSP with two edge weights O Svensson, J Tarnawski, LA Végh Mathematical Programming 172 (1-2), 371-397, 2018 | 10 | 2018 |
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios C Kalaitzis, O Svensson, J Tarnawski Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 9 | 2017 |