Jakub Lacki
Jakub Lacki
research scientist, Google
Vahvistettu sähköpostiosoite verkkotunnuksessa google.com - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Round compression for parallel matching algorithms
A Czumaj, J Łacki, A Madry, S Mitrovic, K Onak, P Sankowski
SIAM Journal on Computing 49 (5), STOC18-1-STOC18-44, 2019
742019
Improved deterministic algorithms for decremental reachability and strongly connected components
J Łącki
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
462013
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
372018
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
372012
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
J Łącki, P Sankowski
European Symposium on Algorithms, 155-166, 2011
372011
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
312015
Faster algorithms for Markov decision processes with low treewidth
K Chatterjee, J Łącki
International Conference on Computer Aided Verification, 543-558, 2013
302013
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
272019
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
262016
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
232016
Community detection on evolving graphs
A Anagnostopoulos, J Łącki, S Lattanzi, S Leonardi, M Mahdian
Advances in Neural Information Processing Systems 29, 3522-3530, 2016
222016
Massively parallel computation via remote memory access
S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy
ACM Transactions on Parallel Computing 8 (3), 1-25, 2021
192021
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
192017
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), 1-10, 2011
182011
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
182011
Connected components at scale via local contractions
J Łącki, V Mirrokni, M Włodarczyk
arXiv preprint arXiv:1807.10727, 2018
152018
Reachability in graph timelines
J Lacki, P Sankowski
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
102013
Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs
A Karczmarz, J Łącki
Symposium on Simplicity in Algorithms, 106-120, 2020
92020
Reliable hubs for partially-dynamic all-pairs shortest paths in directed graphs
A Karczmarz, J Łącki
arXiv preprint arXiv:1907.02266, 2019
92019
Optimal decremental connectivity in planar graphs
J Łącki, P Sankowski
STACS 2015, 2014
92014
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20