v1v2 (latest)

Near-Constant-Time Distributed Algorithms on a Congested Clique

9 August 2014

Papers citing "Near-Constant-Time Distributed Algorithms on a Congested Clique"

24 / 24 papers shown

Title
Sublinear-time Sampling of Spanning Trees in the Congested Clique Sriram V. Pemmaraju Sourya Roy Joshua Sobel 69 0 0 20 Nov 2024
Massively Parallel Ruling Set Made Deterministic Jeff Giliberti Zahra Parsaeian 86 4 0 18 Jun 2024
Fully Scalable MPC Algorithms for Clustering in High Dimension A. Czumaj Guichen Gao S. Jiang Robert Krauthgamer P. Veselý 29 5 0 15 Jul 2023
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem Mélanie Cambus Fabian Kuhn Shreyas Pai Jara Uitto 70 10 0 01 Jun 2023
Deterministic Massively Parallel Algorithms for Ruling Sets Shreyas Pai Sriram V. Pemmaraju 142 2 0 25 May 2022
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity Dariusz R. Kowalski Miguel A. Mosteiro 30 4 0 15 Feb 2022
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 74 8 0 26 Sep 2020
$Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$$ Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ Parikshit Saikia Sushanta Karmakar 22 9 0 28 Jul 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
Large-Scale Distributed Algorithms for Facility Location with Outliers Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju 24 7 0 15 Nov 2018
Distributed Computation in Node-Capacitated Networks John E. Augustine M. Ghaffari R. Gmyr Kristian Hinnenthal Fabian Kuhn Jason Li Christian Scheideler 20 2 0 18 May 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
$MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds$ MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds C. Konrad 43 8 0 21 Feb 2018
Graph Reconstruction in the Congested Clique Pedro Montealegre Sebastian Perez-Salazar I. Rapaport Ioan Todinca 24 5 0 09 Jun 2017
Towards a complexity theory for the congested clique Janne H. Korhonen Jukka Suomela 52 43 0 09 May 2017
Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages Sriram V. Pemmaraju Vivek Sardeshmukh LRM 47 14 0 12 Oct 2016
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
Distributed Testing of Excluded Subgraphs Pierre Fraigniaud I. Rapaport Ville Salo Ioan Todinca 42 37 0 12 May 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 77 57 0 10 Dec 2014
Computing Exact Distances in the Congested Clique K. Censor-Hillel A. Paz 65 4 0 08 Dec 2014
Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique P. Kaski Janne H. Korhonen Christoph Lenzen Jukka Suomela 56 3 0 05 Dec 2014
Lessons from the Congested Clique Applied to MapReduce James Hegeman Sriram V. Pemmaraju 84 86 0 17 May 2014