default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Tarnawski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]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): 87-110 (2024)- [c24]Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong:
Fairness in Submodular Maximization over a Matroid Constraint. AISTATS 2024: 1027-1035 - [c23]Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. ICLR 2024 - [c22]Foteini Strati, Sara McAllister, Amar Phanishayee, Jakub Tarnawski, Ana Klimovic:
DéjàVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving. ICML 2024 - [c21]Irene Wang, Jakub Tarnawski, Amar Phanishayee, Divya Mahajan:
Integrated Hardware Architecture and Device Placement Search. ICML 2024 - [i23]Foteini Strati, Sara McAllister, Amar Phanishayee, Jakub Tarnawski, Ana Klimovic:
DéjàVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving. CoRR abs/2403.01876 (2024) - [i22]Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. CoRR abs/2403.08917 (2024) - [i21]Irene Wang, Jakub Tarnawski, Amar Phanishayee, Divya Mahajan:
Integrated Hardware Architecture and Device Placement Search. CoRR abs/2407.13143 (2024) - 2023
- [c20]Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. ICML 2023: 9150-9171 - [i20]Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. CoRR abs/2305.15118 (2023) - [i19]Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong:
Fairness in Submodular Maximization over a Matroid Constraint. CoRR abs/2312.14299 (2023) - 2022
- [j4]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): 2747-2760 (2022) - [c19]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. NeurIPS 2022 - [c18]Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang:
On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA 2022: 316-328 - [c17]Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski:
Online edge coloring via tree recurrences and correlation decay. STOC 2022: 104-116 - [i18]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 abs/2202.01306 (2022) - [i17]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. CoRR abs/2203.01440 (2022) - 2021
- [j3]Jakub Tarnawski:
New graph algorithms via polyhedral techniques. it Inf. Technol. 63(3): 177-182 (2021) - [c16]Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Correlation Clustering in Constant Many Parallel Rounds. ICML 2021: 2069-2078 - [c15]Jakub Tarnawski, Deepak Narayanan, Amar Phanishayee:
Piper: Multidimensional Planner for DNN Parallelization. NeurIPS 2021: 24829-24840 - [c14]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: 2958-2977 - [i16]Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang:
On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR abs/2105.00111 (2021) - [i15]Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Correlation Clustering in Constant Many Parallel Rounds. CoRR abs/2106.08448 (2021) - [i14]Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski:
Online Edge Coloring via Tree Recurrences and Correlation Decay. CoRR abs/2111.00721 (2021) - 2020
- [j2]Ola Svensson, Jakub Tarnawski, László A. Végh:
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM 67(6): 37:1-37:53 (2020) - [c13]Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang:
Scheduling with Communication Delays via LP Hierarchies and Clustering. FOCS 2020: 822-833 - [c12]Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. NeurIPS 2020 - [c11]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS 2020 - [c10]Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan, Fanny Nina Paravecino:
Efficient Algorithms for Device Placement of DNN Graph Operators. NeurIPS 2020 - [c9]Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye:
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. SODA 2020: 2770-2789 - [i13]Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang:
Scheduling with Communication Delays via LP Hierarchies and Clustering. CoRR abs/2004.09682 (2020) - [i12]Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye:
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. CoRR abs/2004.13891 (2020) - [i11]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR abs/2006.04704 (2020) - [i10]Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan, Fanny Nina Paravecino:
Efficient Algorithms for Device Placement of DNN Graph Operators. CoRR abs/2006.16423 (2020) - [i9]Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. CoRR abs/2010.07431 (2020)
2010 – 2019
- 2019
- [b1]Jakub Tarnawski:
New Graph Algorithms via Polyhedral Techniques. EPFL, Switzerland, 2019 - [p1]Jakub Tarnawski:
Neue Graphen-Algorithmen mittels polyedrischer Methoden. Ausgezeichnete Informatikdissertationen 2019: 209-218 - 2018
- [j1]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant factor approximation for ATSP with two edge weights. Math. Program. 172(1-2): 371-397 (2018) - [c8]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: 3826-3835 - [c7]Ola Svensson, Jakub Tarnawski, László A. Végh:
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC 2018: 204-213 - [i8]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 abs/1808.01842 (2018) - 2017
- [c6]Ola Svensson, Jakub Tarnawski:
The Matching Problem in General Graphs Is in Quasi-NC. FOCS 2017: 696-707 - [c5]Agata Mosinska, Jakub Tarnawski, Pascal Fua:
Active Learning and Proofreading for Delineation of Curvilinear Structures. MICCAI (2) 2017: 165-173 - [c4]Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher:
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. NIPS 2017: 4557-4566 - [c3]Christos Kalaitzis, Ola Svensson, Jakub Tarnawski:
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. SODA 2017: 2654-2669 - [i7]Ola Svensson, Jakub Tarnawski:
The Matching Problem in General Graphs is in Quasi-NC. CoRR abs/1704.01929 (2017) - [i6]Ola Svensson, Jakub Tarnawski, László A. Végh:
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/1708.04215 (2017) - [i5]Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher:
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. CoRR abs/1711.02598 (2017) - [i4]Ola Svensson, Jakub Tarnawski:
The Matching Problem in General Graphs is in Quasi-NC. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO 2016: 226-237 - [i3]Christos Kalaitzis, Ola Svensson, Jakub Tarnawski:
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. CoRR abs/1607.07631 (2016) - 2015
- [c1]Aleksander Madry, Damian Straszak, Jakub Tarnawski:
Fast Generation of Random Spanning Trees and the Effective Resistance Metric. SODA 2015: 2019-2036 - [i2]Aleksander Madry, Damian Straszak, Jakub Tarnawski:
Fast Generation of Random Spanning Trees and the Effective Resistance Metric. CoRR abs/1501.00267 (2015) - [i1]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights. CoRR abs/1511.07038 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
