Jakub Lacki
Jakub Lacki
research scientist, Google
Подтвержден адрес электронной почты в домене google.com - Главная страница
Название
Процитировано
Процитировано
Год
Round compression for parallel matching algorithms
A Czumaj, J Łacki, A Madry, S Mitrovic, K Onak, P Sankowski
SIAM Journal on Computing, STOC18-1-STOC18-44, 2019
522019
Improved deterministic algorithms for decremental reachability and strongly connected components
J Łącki
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
402013
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
J Łącki, P Sankowski
European Symposium on Algorithms, 155-166, 2011
332011
Single source--All sinks max flows in planar digraphs
J Lacki, Y Nussbaum, P Sankowski, C Wulff-Nilsen
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 599-608, 2012
282012
Faster algorithms for Markov decision processes with low treewidth
K Chatterjee, J Łącki
International Conference on Computer Aided Verification, 543-558, 2013
272013
The power of dynamic distance oracles: Efficient dynamic algorithms for the steiner tree
J Łącki, J Oćwieja, M Pilipczuk, P Sankowski, A Zych
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
242015
Algorithmic complexity of power law networks
P Brach, M Cygan, J Łącki, P Sankowski
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
222016
Optimal dynamic strings
P Gawrychowski, A Karczmarz, T Kociumaka, J Łącki, P Sankowski
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
212018
Decremental single-source reachability and strongly connected components in O (m√ n) total update time
S Chechik, TD Hansen, GF Italiano, J Łącki, N Parotsidis
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
202016
Community detection on evolving graphs
A Anagnostopoulos, J Łącki, S Lattanzi, S Leonardi, M Mahdian
Advances in Neural Information Processing Systems, 3522-3530, 2016
182016
Acorn: a grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface
J Sroka, Ł Bieniasz-Krzywiec, S Gwóźdź, D Leniowski, J Łącki, ...
BMC bioinformatics 12 (1), 196, 2011
172011
Improved deterministic algorithms for decremental transitive closure and strongly connected components
J Łącki
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
152011
Decremental single-source reachability in planar digraphs
GF Italiano, A Karczmarz, J Łącki, P Sankowski
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
132017
Near-optimal massively parallel graph connectivity
S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
102019
Massively parallel computation via remote memory access
S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 59-68, 2019
92019
Reachability in graph timelines
J Lacki, P Sankowski
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
92013
Optimal decremental connectivity in planar graphs
J Łącki, P Sankowski
STACS 2015, 2014
82014
Connected components at scale via local contractions
J Łącki, V Mirrokni, M Włodarczyk
arXiv preprint arXiv:1807.10727, 2018
62018
Connected components at scale via local contractions
J Lacki, VS Mirrokni, M Wlodarczyk
CoRR, abs/1807.10727, 2018
52018
Contracting a planar graph efficiently
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski
arXiv preprint arXiv:1706.10228, 2017
52017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20