ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1912.04239
  4. Cited By
A Deterministic Algorithm for the MST Problem in Constant Rounds of
  Congested Clique

A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique

9 December 2019
Krzysztof Nowicki
ArXivPDFHTML

Papers citing "A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique"

4 / 4 papers shown
Title
MST in O(1) Rounds of the Congested Clique
MST in O(1) Rounds of the Congested Clique
T. Jurdzinski
Krzysztof Nowicki
LRM
26
92
0
26 Jul 2017
Deterministic MST Sparsification in the Congested Clique
Deterministic MST Sparsification in the Congested Clique
Janne H. Korhonen
LRM
15
22
0
06 May 2016
Lessons from the Congested Clique Applied to MapReduce
Lessons from the Congested Clique Applied to MapReduce
James Hegeman
Sriram V. Pemmaraju
44
86
0
17 May 2014
Optimal Deterministic Routing and Sorting on the Congested Clique
Optimal Deterministic Routing and Sorting on the Congested Clique
Christoph Lenzen
53
168
0
08 Jul 2012
1