Jakub Tarnawski

Orcid: 0000-0001-6175-5827

According to our database1, Jakub Tarnawski authored at least 29 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Online Edge Coloring via Tree Recurrences and Correlation Decay.
SIAM J. Comput., February, 2024

Integrated Hardware Architecture and Device Placement Search.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

DéjàVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Efficiently Computing Similarities to Private Datasets.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Fairness in Submodular Maximization over a Matroid Constraint.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint.
Proceedings of the International Conference on Machine Learning, 2023

2022
Harmony: Overcoming the hurdles of GPU memory capacity to train massive DNN models on commodity servers.
Proc. VLDB Endow., 2022

On the Hardness of Scheduling With Non-Uniform Communication Delays.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Near-Optimal Correlation Clustering with Privacy.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
New graph algorithms via polyhedral techniques.
it Inf. Technol., 2021

Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Piper: Multidimensional Planner for DNN Parallelization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Correlation Clustering in Constant Many Parallel Rounds.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
J. ACM, 2020

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Efficient Algorithms for Device Placement of DNN Graph Operators.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fully Dynamic Algorithm for Constrained Submodular Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fairness in Streaming Submodular Maximization: Algorithms and Hardness.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Scheduling with Communication Delays via LP Hierarchies and Clustering.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Neue Graphen-Algorithmen mittels polyedrischer Methoden.
Proceedings of the Ausgezeichnete Informatikdissertationen 2019., 2019

New Graph Algorithms via Polyhedral Techniques.
PhD thesis, 2019

2018
Constant factor approximation for ATSP with two edge weights.
Math. Program., 2018

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
The Matching Problem in General Graphs is in Quasi-NC.
Electron. Colloquium Comput. Complex., 2017

Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Active Learning and Proofreading for Delineation of Curvilinear Structures.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2017, 2017

2016
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015
Fast Generation of Random Spanning Trees and the Effective Resistance Metric.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015


  Loading...