7 citations · 11 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2017
Round Compression for Parallel Matching Algorithms
Artur Czumaj, Jakub Łącki, Aleksander Mądry +3
For over a decade now we have been witnessing the success of {\em massive parallel computation} (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for…
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…
cs.DS2013★ 7 cited
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
Jakub Łącki, Jakub Oćwieja, Marcin Pilipczuk +2
In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an -vertex graph with positive real edge we…