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. 1412.2333
  4. Cited By
Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$
  Rounds on the Congested Clique

Minimum-weight Spanning Tree Construction in O(log⁡log⁡log⁡n)O(\log \log \log n)O(logloglogn) Rounds on the Congested Clique

7 December 2014
Sriram V. Pemmaraju
Vivek Sardeshmukh
ArXiv (abs)PDFHTML

Papers citing "Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique"

1 / 1 papers shown
Title
Algebraic Methods in the Congested Clique
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
1