Jakub Tarnawski

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 50

Top Topics

Efficiently Computing

Communication Delays

Posterior Marginals

Top Venues

Publications

Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
Efficiently Computing Similarities to Private Datasets. ICLR (2024)
Foteini Strati, Sara McAllister, Amar Phanishayee, Jakub Tarnawski, Ana Klimovic
DéjàVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving. CoRR (2024)
Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong
Fairness in Submodular Maximization over a Matroid Constraint. AISTATS (2024)
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski
Online Edge Coloring via Tree Recurrences and Correlation Decay. SIAM J. Comput. 53 (1) (2024)
Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
Efficiently Computing Similarities to Private Datasets. CoRR (2024)
Irene Wang, Jakub Tarnawski, Amar Phanishayee, Divya Mahajan
Integrated Hardware Architecture and Device Placement Search. CoRR (2024)
Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong
Fairness in Submodular Maximization over a Matroid Constraint. CoRR (2023)
Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
Fairness in Streaming Submodular Maximization over a Matroid Constraint. CoRR (2023)
Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
Fairness in Streaming Submodular Maximization over a Matroid Constraint. ICML (2023)
Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Near-Optimal Correlation Clustering with Privacy. NeurIPS (2022)
Youjie Li, Amar Phanishayee, Derek Murray, Jakub Tarnawski, Nam Sung Kim
Harmony: Overcoming the hurdles of GPU memory capacity to train massive DNN models on commodity servers. Proc. VLDB Endow. 15 (11) (2022)
Youjie Li, Amar Phanishayee, Derek Murray, Jakub Tarnawski, Nam Sung Kim
Harmony: Overcoming the hurdles of GPU memory capacity to train massive DNN models on commodity servers. CoRR (2022)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA (2022)
Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Near-Optimal Correlation Clustering with Privacy. CoRR (2022)
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
Online edge coloring via tree recurrences and correlation decay. STOC (2022)
Jakub Tarnawski
New graph algorithms via polyhedral techniques. it Inf. Technol. 63 (3) (2021)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR (2021)
Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Correlation Clustering in Constant Many Parallel Rounds. CoRR (2021)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. SODA (2021)
Jakub Tarnawski, Deepak Narayanan, Amar Phanishayee
Piper: Multidimensional Planner for DNN Parallelization. NeurIPS (2021)
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski
Online Edge Coloring via Tree Recurrences and Correlation Decay. CoRR (2021)
Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Correlation Clustering in Constant Many Parallel Rounds. ICML (2021)
Ola Svensson, Jakub Tarnawski, László A. Végh
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM 67 (6) (2020)
Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. SODA (2020)
Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR (2020)
Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. NeurIPS (2020)
Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS (2020)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
Scheduling with Communication Delays via LP Hierarchies and Clustering. FOCS (2020)
Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. CoRR (2020)
Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan, Fanny Nina Paravecino
Efficient Algorithms for Device Placement of DNN Graph Operators. NeurIPS (2020)
Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. CoRR (2020)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
Scheduling with Communication Delays via LP Hierarchies and Clustering. CoRR (2020)
Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan, Fanny Nina Paravecino
Efficient Algorithms for Device Placement of DNN Graph Operators. CoRR (2020)
Ola Svensson, Jakub Tarnawski, László A. Végh
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC (2018)
Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. ICML (2018)
Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aida Mousavifar, Ola Svensson
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. CoRR (2018)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant factor approximation for ATSP with two edge weights. Math. Program. 172 (1-2) (2018)
Ola Svensson, Jakub Tarnawski, László A. Végh
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR (2017)
Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. CoRR (2017)
Ola Svensson, Jakub Tarnawski
The Matching Problem in General Graphs is in Quasi-NC. CoRR (2017)
Agata Mosinska, Jakub Tarnawski, Pascal Fua
Active Learning and Proofreading for Delineation of Curvilinear Structures. MICCAI (2) (2017)
Ola Svensson, Jakub Tarnawski
The Matching Problem in General Graphs is in Quasi-NC. Electron. Colloquium Comput. Complex. 24 (2017)
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. SODA (2017)
Ola Svensson, Jakub Tarnawski
The Matching Problem in General Graphs Is in Quasi-NC. FOCS (2017)
Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. NIPS (2017)
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. CoRR (2016)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO (2016)
Aleksander Madry, Damian Straszak, Jakub Tarnawski
Fast Generation of Random Spanning Trees and the Effective Resistance Metric. SODA (2015)
Aleksander Madry, Damian Straszak, Jakub Tarnawski
Fast Generation of Random Spanning Trees and the Effective Resistance Metric. CoRR (2015)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant Factor Approximation for ATSP with Two Edge Weights. CoRR (2015)