4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DC2023
Adaptive Massively Parallel Connectivity in Optimal Space
Rustam Latypov, Jakub Łącki, Yannic Maus +1
We study the problem of finding connected components in the Adaptive Massively Parallel Computation (AMPC) model. We show that when we require the total space to be linear in the s…
cs.DS2014★ 4 cited
Optimal decremental connectivity in planar graphs
Jakub Łącki, Piotr Sankowski
We show an algorithm for dynamic maintenance of connectivity information in an undirected planar graph subject to edge deletions. Our algorithm may answer connectivity queries of t…