( en | de | ru )

 

Disambiguation of "Tarnawski, Jakub"

Author of the publication

copydeleteadd this publication to your clipboard
On the Hardness of Scheduling With Non-Uniform Communication Delays.

, , , , , and . CoRR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rafael Tarnawski

Jakub Mácha

Analytische Theorien der Metapher: Untersuchungen zum Konzept der metaphorischen Bedeutung. Uni Hannover, (2009)

Jakub Kopycki

Jakub Hodek

Jakub Limanowski

 

Other publications of authors with the same name

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams., , , , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 3826-3835. PMLR, (2018)Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints., , , and . SODA, page 2770-2789. SIAM, (2020)Piper: Multidimensional Planner for DNN Parallelization., , and . NeurIPS, page 24829-24840. (2021)Fairness in Streaming Submodular Maximization over a Matroid Constraint., , , , and . CoRR, (2023)DéjàVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Serving., , , , and . ICML, OpenReview.net, (2024)Active Learning and Proofreading for Delineation of Curvilinear Structures., , and . MICCAI (2), volume 10434 of Lecture Notes in Computer Science, page 165-173. Springer, (2017)New Graph Algorithms via Polyhedral Techniques.. EPFL, Switzerland, (2019)A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem., , and . CoRR, (2017)Scheduling with Communication Delays via LP Hierarchies and Clustering., , , , and . FOCS, page 822-833. IEEE, (2020)Near-Optimal Correlation Clustering with Privacy., , , , , , and . NeurIPS, (2022)