v1v2 (latest)

Lessons from the Congested Clique Applied to MapReduce

17 May 2014

Papers citing "Lessons from the Congested Clique Applied to MapReduce"

25 / 25 papers shown

Title
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs Manuela Fischer Jeff Giliberti Christoph Grunau 61 5 0 26 Jan 2023
A New Model for Massively Parallel Computation Considering both Communication and IO Cost Hengzhao Ma Xiangyu Gao Jianzhong Li Tian-Hui Gao 25 0 0 24 Mar 2022
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity Dariusz R. Kowalski Miguel A. Mosteiro 27 4 0 15 Feb 2022
Distributed Computing With the Cloud Y. Afek Gal Giladi B. Patt-Shamir 62 7 0 27 Sep 2021
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 73 18 0 09 Aug 2021
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 131 23 0 06 Mar 2020
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 48 20 0 02 Mar 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 61 18 0 07 Jan 2020
A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique Krzysztof Nowicki 47 36 0 09 Dec 2019
Sparse Hopsets in Congested Clique Yasamin Nazari 17 1 0 17 Nov 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 33 35 0 06 Jun 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 56 54 0 14 Mar 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju 23 7 0 15 Nov 2018
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 59 66 0 07 Nov 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation M. Ghaffari Jara Uitto 58 103 0 17 Jul 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 91 132 0 22 Feb 2018
$MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds$ MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds C. Konrad 38 8 0 21 Feb 2018
MST in O(1) Rounds of the Congested Clique T. Jurdzinski Krzysztof Nowicki LRM 49 92 0 26 Jul 2017
Graph Reconstruction in the Congested Clique Pedro Montealegre Sebastian Perez-Salazar I. Rapaport Ioan Todinca 24 5 0 09 Jun 2017
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems F. Gall 44 48 0 09 Aug 2016
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions K. Censor-Hillel M. Parter Gregory Schwartzman 82 75 0 04 Aug 2016
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 54 160 0 17 Mar 2015
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique S. Holzer N. Pinsker 74 57 0 10 Dec 2014
Near-Constant-Time Distributed Algorithms on a Congested Clique James Hegeman Sriram V. Pemmaraju Vivek Sardeshmukh 84 58 0 09 Aug 2014
Distributed Algorithms for Large-Scale Graphs Khalid Hourani H. Klauck W. Moses Danupon Nanongkai Gopal Pandurangan Peter Robinson Michele Scquizzato 60 2 0 25 Nov 2013