7 citations · 11 across the 5 of their papers we have counts for
6 papers
PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
Tobias Rubel, Richard Wen, Laxman Dhulipala +3
The fastest indexes for Approximate Nearest Neighbor Search today are also the slowest to build: graph-based methods like HNSW and Vamana achieve state-of-the-art query performance…
Phase transitions in the Prisoner's Dilemma game on scale-free networks
Jacek Miękisz, Javad Mohamadichamgavi, Jakub Łącki
We study stochastic dynamics of the Prisoner's Dilemma game on random Erdös-Rényi and Barabási-Albert networks with a cost of maintaining a link between interacting players. Stocha…
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…
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…
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…
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…