I am a researcher at Microsoft Research.
I am broadly interested in theoretical computer science and combinatorial optimization, particularly in graph algorithms and approximation algorithms.
I completed my PhD in Computer Science in 2024 at 蓝鲸加速器 安卓, where
I was fortunate to have 火箭加速器 安卓 官网 as my advisor.
I received my MSc in Mathematics and Computer Science
from the University of Wrocław, Poland.
Email
firstname.lastname at microsoft.com
mac加速器免费版- 狗急加速器
Fully Dynamic Algorithm for Constrained Submodular Optimization Silvio Lattanzi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakub Tarnawski and Morteza Zadimoghaddam
Preprint (arXiv)
lonlife珑凌/玲珑网游加速器-最稳定的游戏加速器【官方网站】:2021-6-4 · 玲珑加速器-最稳定的游戏加速器! 使用国际高速线路,支持加速各种游戏. 超稳定,低延迟,0丢包,畅玩全球游戏! 十年老牌加速器,千万游戏玩家的首选,注册免费试用! Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski and Yihao Zhang
Preprint (arXiv)
Accepted to FOCS 2024
Efficient Algorithms for Device Placement of DNN Graph Operators Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan and Fanny Nina Paravecino
Preprint (arXiv)
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints Janardhan Kulkarni, Shi Li, Jakub Tarnawski and Minwei Ye
Conference version: 鲸鱼加速器 安卓
Full version (arXiv)
Slides (20 min, pptx) from SODA
Virtual seminar (50 min, University of Wrocław)
Recent Results on the Traveling Salesman Problem Jakub Tarnawski and Vera Traub
short survey
SIAG/OPT Views and News (newsletter of the SIAM Activity Group on Optimization)
Beyond 1/2-Approximation for Submodular Maximization
on Massive Data Streams Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrović, Amir Zandieh, Aida Mousavifar and Ola Svensson
Conference version: ICML 2018 (long talk)
Full version (arXiv)
蓝鲸加速器 安卓 by Aida
Slides (12 min, pptx) - Aida at ICML
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem Ola Svensson, Jakub Tarnawski and László Végh
Conference version: STOC 2018 (extended abstract: main ideas in 10 pages; single-column version)
Best Paper Award
Full version (arXiv)
Poster from STOC
Videos:
me at STOC (25 min, slides pptx)
快喵加速器 安卓 or at Georgia Tech (60 min, focus on solving Local-Connectivity ATSP for vertebrate pairs)
me at Microsoft Research Redmond or
Ola at TCS+ (45-60 min, focus on the other parts)
Ola at IAS (2h board talk)
For a broader audience:
article in Quanta Magazine
three videos by EPFL's ZettaBytes: one, two, three
Course at University of Bonn
The Matching Problem in General Graphs is in Quasi-NC Ola Svensson and Jakub Tarnawski
Conference version: FOCS 2017
Best Paper Award
Full version (arXiv)
Poster from HALG 2017
Slides: 25 min from FOCS, 雷霆加速器 安卓 from ETH Zürich, 50 min from Georgia Tech