Jakub Tarnawski
Jakub Tarnawski
Researcher, Microsoft Research
Подтвержден адрес электронной почты в домене microsoft.com - Главная страница
Название
Процитировано
Процитировано
Год
Fast generation of random spanning trees and the effective resistance metric
A Mądry, D Straszak, J Tarnawski
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015
482015
The matching problem in general graphs is in quasi-NC
O Svensson, J Tarnawski
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
332017
Beyond -Approximation for Submodular Maximization on Massive Data Streams
A Norouzi-Fard, J Tarnawski, S Mitrović, A Zandieh, A Mousavifar, ...
arXiv preprint arXiv:1808.01842, 2018
302018
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
O Svensson, J Tarnawski, LA Végh
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
292018
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
S Mitrović, I Bogunovic, A Norouzi-Fard, J Tarnawski, V Cevher
Advances in Neural Information Processing Systems, 4558-4567, 2017
222017
Active Learning and Proofreading for Delineation of Curvilinear Structures
A Mosinska, J Tarnawski, P Fua
International Conference on Medical Image Computing and Computer-Assisted …, 2017
132017
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
C Kalaitzis, O Svensson, J Tarnawski
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
72017
Constant factor approximation for ATSP with two edge weights
O Svensson, J Tarnawski, LA Végh
Mathematical Programming 172 (1-2), 371-397, 2018
22018
New Graph Algorithms via Polyhedral Techniques
J Tarnawski
EPFL, 2019
12019
Fully Dynamic Algorithm for Constrained Submodular Optimization
S Lattanzi, S Mitrović, A Norouzi-Fard, J Tarnawski, M Zadimoghaddam
arXiv preprint arXiv:2006.04704, 2020
2020
Scheduling with Communication Delays via LP Hierarchies and Clustering
S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang
arXiv preprint arXiv:2004.09682, 2020
2020
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
J Kulkarni, S Li, J Tarnawski, M Ye
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
2020
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–12