alphaFeedback
JŁ

Jakub Łącki

cs.DScs.DCcs.LGcs.IRcs.DBcs.SIcs.AIcs.CCcs.DMcs.CV

On Valency

published · living versions
W_24yjzasy·v1 · currentpublished
GINGER: Spicing Up Graph-Based Vector Search
with Daniel Salwasser, Lars Gottesbüren, Laxman Dhulipala, Guy Blelloch +5
1 version

Preprints & journals

49 papers in the corpus · 2011–2026
Constant-Factor Local Approximation for Bipartite Densest Subgraph2610.24114v1 · Michael Kapralov, Jakub \Lacki, Silvio Lattanzi et al.2026 · 0 citationsarXiv
PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing2602.21247v3 · Tobias Rubel, Richard Wen, Laxman Dhulipala et al.2026 · 4 citationsarXiv
Chamfer-Linkage for Hierarchical Agglomerative Clustering2602.10444v1 · Kishen N Gowda, Willem Fletcher, MohammadHossein Bateni et al.2026 · 0 citationsarXiv
JAG: Joint Attribute Graphs for Filtered Nearest Neighbor Search2602.10258v1 · Haike Xu, Guy Blelloch, Laxman Dhulipala et al.2026 · 0 citationsarXiv
Aggregating maximal cliques in real-world graphs2512.03960v1 · Noga Alon, Sabyasachi Basu, Shweta Jain et al.2025 · 0 citationsarXiv
Parallel Hierarchical Agglomerative Clustering in Low Dimensions2507.20047v1 · MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher et al.2025 · 0 citationsarXiv
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs2506.04524v1 · Jakub \Lacki, Slobodan Mitrovi'c, Srikkanth Ramachandran et al.2025 · 1 citationarXiv
DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering2501.07745v1 · Shangdi Yu, Laxman Dhulipala, Jakub \Lacki et al.2025 · 1 citationarXiv
Towards Scalable and Practical Batch-Dynamic Connectivity2411.11781v1 · Quinten De Man, Laxman Dhulipala, Adam Karczmarz et al.2024 · 2 citationsarXiv
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering2411.10290v1 · Shangdi Yu, Jessica Shi, Jamison Meindl et al.2024 · 0 citationsarXiv
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling2408.13362v2 · Laxman Dhulipala, Michael Dinitz, Jakub \Lacki et al.2024 · 3 citationsarXiv
Massively Parallel Minimum Spanning Tree in General Metric Spaces2408.06455v2 · Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram et al.2024 · 4 citationsarXiv
Efficient Centroid-Linkage Clustering2406.05066v1 · MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher et al.2024 · 1 citationarXiv
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers2405.11671v1 · Brian Wheatman, Xiaojun Dong, Zheqi Shen et al.2024 · 7 citationsarXiv
Dynamic PageRank: Algorithms and Lower Bounds2404.16267v2 · Rajesh Jayaram, Jakub \Lacki, Slobodan Mitrovi'c et al.2024 · 25 citationsarXiv
It's Hard to HAC with Average Linkage!2404.14730v2 · MohammadHossein Bateni, Laxman Dhulipala, Kishen N Gowda et al.2024 · 0 citationsarXiv
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search2403.01797v1 · Lars Gottesburen, Laxman Dhulipala, Rajesh Jayaram et al.2024 · 4 citationsarXiv
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs2308.03578v2 · Laxman Dhulipala, Jason Lee, Jakub \Lacki et al.2023 · 10 citationsarXiv
Fully Dynamic Consistent kk-Center Clustering2307.13747v1 · Jakub \Lacki, Bernhard Haeupler, Christoph Grunau et al.2023 · 7 citationsarXiv
Phase transitions in the Prisoner's Dilemma game on scale-free networks2304.02896v2 · Jacek Miekisz, Javad Mohamadichamgavi, Jakub \Lacki2023 · 0 citationsBioPhysMath, 2024: 1, 9pp
Adaptive Massively Parallel Connectivity in Optimal Space2302.04033v2 · Rustam Latypov, Jakub \Lacki, Yannic Maus et al.2023 · 0 citationsarXiv
Constant Approximation for Normalized Modularity and Associations Clustering2212.14334v1 · Jakub \Lacki, Vahab Mirrokni, Christian Sohler2022 · 0 citationsarXiv
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth2206.11654v1 · Laxman Dhulipala, David Eisenstat, Jakub \Lacki et al.2022 · 8 citationsarXiv
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds2206.07554v1 · Sepehr Assadi, Vaggos Chatziafratis, Jakub \Lacki et al.2022 · 2 citationsarXiv
Optimal Decremental Connectivity in Non-Sparse Graphs2111.09376v2 · Anders Aaman, Adam Karczmarz, Jakub \Lacki et al.2021 · 1 citationarXiv
Scalable Community Detection via Parallel Correlation Clustering2108.01731v1 · Jessica Shi, Laxman Dhulipala, David Eisenstat et al.2021 · 23 citationsarXiv
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time2106.05610v1 · Laxman Dhulipala, David Eisenstat, Jakub \Lacki et al.2021 · 12 citationsarXiv
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice2009.11552v1 · Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari et al.2020 · 2 citationsarXiv
Near-Optimal Decremental Hopsets with Applications2009.08416v5 · Jakub \Lacki, Yasamin Nazari2020 · 2 citationsarXiv
Faster DBSCAN via subsampled similarity queries2006.06743v2 · Heinrich Jiang, Jennifer Jang, Jakub \Lacki2020 · 9 citationsarXiv
Fully Dynamic Matching: Beating 2-Approximation in Δϵ\Delta^\epsilon Update Time1911.01839v1 · Soheil Behnezhad, Jakub \Lacki, Vahab Mirrokni2019 · 0 citationsarXiv
Near-Optimal Massively Parallel Graph Connectivity1910.05385v2 · Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari et al.2019 · 37 citationsarXiv
Walking Randomly, Massively, and Efficiently1907.05391v4 · Jakub \Lacki, Slobodan Mitrovi'c, Krzysztof Onak et al.2019 · 20 citationsarXiv
Massively Parallel Computation via Remote Memory Access1905.07533v1 · Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari et al.2019 · 29 citationsarXiv
Connected Components at Scale via Local Contractions1807.10727v1 · Jakub \Lacki, Vahab Mirrokni, MichałW\lodarczyk2018 · 11 citationsarXiv
Decremental SPQR-trees for Planar Graphs1806.10772v1 · Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz et al.2018 · 3 citationsarXiv
Round Compression for Parallel Matching Algorithms1707.03478v2 · Artur Czumaj, Jakub \Lacki, Aleksander Madry et al.2017 · 67 citationsarXiv
Contracting a Planar Graph Efficiently1706.10228v1 · Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz et al.2017 · 2 citationsarXiv
Decremental Single-Source Reachability in Planar Digraphs1705.11163v2 · Giuseppe F. Italiano, Adam Karczmarz, Jakub \Lacki et al.2017 · 17 citationsarXiv
Optimal Dynamic Strings1511.02612v2 · PawełGawrychowski, Adam Karczmarz, Tomasz Kociumaka et al.2015 · 44 citationsarXiv
Algorithmic Complexity of Power Law Networks1507.02426v1 · PawełBrach, Marek Cygan, Jakub \Lacki et al.2015 · 13 citationsarXiv
Fast and simple connectivity in graph timelines1506.02973v1 · Adam Karczmarz, Jakub \Lacki2015 · 5 citationsarXiv
Optimal decremental connectivity in planar graphs1409.7240v1 · Jakub \Lacki, Piotr Sankowski2014 · 7 citationsarXiv
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree1308.3336v5 · Jakub \Lacki, Jakub O'cwieja, Marcin Pilipczuk et al.2013 · 7 citationsarXiv
Faster Algorithms for Markov Decision Processes with Low Treewidth1304.0084v2 · Krishnendu Chatterjee, Jakub \Lacki2013 · 34 citationsarXiv
Single Source - All Sinks Max Flows in Planar Digraphs1210.4811v1 · Jakub \Lacki, Yahav Nussbaum, Piotr Sankowski et al.2012 · 19 citationsarXiv
Acorn: a grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface.21609434 · Sroka, Jacek, Bieniasz-Krzywiec, Lukasz, Gwóźdź, Szymon et al.2011 · 19 citationsBMC bioinformatics. 2011;12:196
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time1104.4890v1 · Jakub \Lacki, Piotr Sankowski2011 · 0 citationsarXiv
Career total: 76 works. 49 are in this corpus.

Profile built from the corpus for this byline.

Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.