v1v2 (latest)

Parallel Algorithms for Geometric Graph Problems

30 December 2013

Papers citing "Parallel Algorithms for Geometric Graph Problems"

39 / 39 papers shown

Title
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs Yi-Jun Chang Danling Zheng 94 1 0 15 Apr 2023
Massively Parallel Algorithms for $b$ -Matching M. Ghaffari Christoph Grunau Slobodan Mitrovic FedML 44 7 0 14 Nov 2022
Exponential Speedup Over Locality in MPC with Optimal Memory Alkida Balliu S. Brandt Manuela Fischer R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 65 5 0 19 Aug 2022
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 61 21 0 10 Dec 2021
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 81 18 0 09 Aug 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 66 24 0 03 Jun 2021
An Accurate and Efficient Large-scale Regression Method through Best Friend Clustering Kun Li Liang Yuan Yunquan Zhang Gongwei Chen 51 0 0 22 Apr 2021
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 80 8 0 26 Sep 2020
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 97 20 0 02 Mar 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 63 18 0 07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 39 1 0 05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 83 29 0 11 Dec 2019
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators Alexandr Andoni C. Stein Peilin Zhong 58 56 0 05 Nov 2019
String Matching with Wildcards in the Massively Parallel Computation Model Mohammadtaghi Hajiaghayi Hamed Saleh Saeed Seddighin Xiaorui Sun 76 11 0 25 Oct 2019
"Bring Your Own Greedy"+Max: Near-Optimal $1/2$ -Approximations for Submodular Knapsack Dmitrii Avdiukhin G. Yaroslavtsev Samson Zhou 55 35 0 12 Oct 2019
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 75 52 0 11 Oct 2019
$A Direct $\tilde{O}(1/ε)$ Iteration Parallel Algorithm for Optimal Transport$ A Direct $\tilde{O}(1/ε)$ Iteration Parallel Algorithm for Optimal Transport A. Jambulapati Aaron Sidford Kevin Tian OT 30 21 0 03 Jun 2019
Dynamic Algorithms for the Massively Parallel Computation Model G. Italiano Silvio Lattanzi Vahab S. Mirrokni Nikos Parotsidis 49 27 0 22 May 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 99 62 0 11 Jan 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju 29 7 0 15 Nov 2018
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 67 66 0 07 Nov 2018
A Unified Framework for Clustering Constrained Data without Locality Property Hu Ding Jinhui Xu 74 51 0 02 Oct 2018
Parallel and Streaming Algorithms for K-Core Decomposition Hossein Esfandiari Silvio Lattanzi Vahab Mirrokni 31 32 0 07 Aug 2018
Connected Components at Scale via Local Contractions Jakub Lacki Vahab Mirrokni Michał Włodarczyk 71 18 0 27 Jul 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 68 30 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 61 18 0 17 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation M. Ghaffari Jara Uitto 64 103 0 17 Jul 2018
Parallel Graph Connectivity in Log Diameter Rounds Alexandr Andoni C. Stein Zhao Song Zhengyu Wang Peilin Zhong 63 99 0 08 May 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 54 58 0 08 May 2018
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce Mahdi Boroujeni S. Ehsani Mohammad Ghodsi Mohammadtaghi Hajiaghayi Saeed Seddighin 44 74 0 11 Apr 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 98 132 0 22 Feb 2018
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs Sepehr Assadi M. Bateni A. Bernstein Vahab Mirrokni Cliff Stein 66 124 0 08 Nov 2017
Simple Round Compression for Parallel Vertex Cover Sepehr Assadi 51 30 0 14 Sep 2017
Round Compression for Parallel Matching Algorithms A. Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak Piotr Sankowski 85 101 0 11 Jul 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration Jason M. Altschuler Jonathan Niles-Weed Philippe Rigollet OT 93 596 0 26 May 2017
On the Distributed Complexity of Large-Scale Graph Computations Gopal Pandurangan Peter Robinson Michele Scquizzato 86 53 0 26 Feb 2016
A New Framework for Distributed Submodular Maximization R. Barbosa Alina Ene Huy Le Nguyen Justin Ward 90 87 0 14 Jul 2015
Randomized Composable Core-sets for Distributed Submodular Maximization Vahab Mirrokni Morteza Zadimoghaddam 166 128 0 22 Jun 2015
Distributed Algorithms for Large-Scale Graphs Khalid Hourani H. Klauck W. Moses Danupon Nanongkai Gopal Pandurangan Peter Robinson Michele Scquizzato 82 2 0 25 Nov 2013