Follow
Jakub Lacki
Jakub Lacki
research scientist, Google
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
Round compression for parallel matching algorithms
A Czumaj, J Łącki, A Mądry, S Mitrović, K Onak, P Sankowski
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
1002018
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
632018
Improved deterministic algorithms for decremental reachability and strongly connected components
J Łącki
ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013
612013
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
592019
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
J Łącki, P Sankowski
European Symposium on Algorithms, 155-166, 2011
502011
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
422015
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
422012
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
402021
Faster algorithms for Markov decision processes with low treewidth
K Chatterjee, J Łącki
International Conference on Computer Aided Verification, 543-558, 2013
362013
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time
S Behnezhad, J Łącki, V Mirrokni
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
352020
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
332016
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
292016
Scalable community detection via parallel correlation clustering
J Shi, L Dhulipala, D Eisenstat, J Łącki, V Mirrokni
arXiv preprint arXiv:2108.01731, 2021
282021
Walking randomly, massively, and efficiently
J Łącki, S Mitrović, K Onak, P Sankowski
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
282020
Hierarchical agglomerative graph clustering in nearly-linear time
L Dhulipala, D Eisenstat, J Łącki, V Mirrokni, J Shi
International conference on machine learning, 2676-2686, 2021
252021
Community detection on evolving graphs
A Anagnostopoulos, J Łącki, S Lattanzi, S Leonardi, M Mahdian
Advances in Neural Information Processing Systems 29, 2016
252016
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
242017
Reliable hubs for partially-dynamic all-pairs shortest paths in directed graphs
A Karczmarz, J Łącki
arXiv preprint arXiv:1907.02266, 2019
222019
Connected components at scale via local contractions
J Łącki, V Mirrokni, M Włodarczyk
arXiv preprint arXiv:1807.10727, 2018
212018
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
212011
The system can't perform the operation now. Try again later.
Articles 1–20