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. 1207.1852
  4. Cited By
Optimal Deterministic Routing and Sorting on the Congested Clique

Optimal Deterministic Routing and Sorting on the Congested Clique

8 July 2012
Christoph Lenzen
ArXivPDFHTML

Papers citing "Optimal Deterministic Routing and Sorting on the Congested Clique"

4 / 4 papers shown
Title
Computing Shortest Paths and Diameter in the Hybrid Network Model
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
51
31
0
15 Jun 2020
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed
  Setting
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Danny Dolev
Christoph Lenzen
Shir Peled
40
111
0
31 Jan 2012
Tight Bounds for Parallel Randomized Load Balancing
Tight Bounds for Parallel Randomized Load Balancing
Christoph Lenzen
Roger Wattenhofer
75
65
0
26 Feb 2011
Distributed Verification and Hardness of Distributed Approximation
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma
S. Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
57
344
0
12 Nov 2010
1