Towards a complexity theory for the congested clique

9 May 2017

Papers citing "Towards a complexity theory for the congested clique"

9 / 9 papers shown

Title
Distributed MST: A Smoothed Analysis Soumyottam Chatterjee Gopal Pandurangan N. Pham 39 10 0 06 Nov 2019
New Classes of Distributed Time Complexity Alkida Balliu J. Hirvonen Janne H. Korhonen Tuomo Lempiäinen Dennis Olivetti Jukka Suomela 31 53 0 06 Nov 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 40 96 0 20 Apr 2017
On the Distributed Complexity of Large-Scale Graph Computations Gopal Pandurangan Peter Robinson Michele Scquizzato 50 53 0 26 Feb 2016
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 33 160 0 17 Mar 2015
Near-Constant-Time Distributed Algorithms on a Congested Clique James Hegeman Sriram V. Pemmaraju Vivek Sardeshmukh 65 58 0 09 Aug 2014
Optimal Deterministic Routing and Sorting on the Congested Clique Christoph Lenzen 67 168 0 08 Jul 2012
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting Danny Dolev Christoph Lenzen Shir Peled 63 111 0 31 Jan 2012
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma S. Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer 80 346 0 12 Nov 2010