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. 1408.2071
  4. Cited By
Near-Constant-Time Distributed Algorithms on a Congested Clique

Near-Constant-Time Distributed Algorithms on a Congested Clique

9 August 2014
James Hegeman
Sriram V. Pemmaraju
Vivek Sardeshmukh
ArXivPDFHTML

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

4 / 4 papers shown
Title
Lessons from the Congested Clique Applied to MapReduce
Lessons from the Congested Clique Applied to MapReduce
James Hegeman
Sriram V. Pemmaraju
48
86
0
17 May 2014
A Super-Fast Distributed Algorithm for Bipartite Metric Facility
  Location
A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location
James Hegeman
Sriram V. Pemmaraju
44
3
0
12 Aug 2013
Super-Fast Distributed Algorithms for Metric Facility Location
Super-Fast Distributed Algorithms for Metric Facility Location
Andrew Berns
James Hegeman
Sriram V. Pemmaraju
54
32
0
12 Aug 2013
Optimal Deterministic Routing and Sorting on the Congested Clique
Optimal Deterministic Routing and Sorting on the Congested Clique
Christoph Lenzen
59
168
0
08 Jul 2012
1