Jakub Tarnawski

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