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.2109
  4. Cited By

Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique

5 December 2014
P. Kaski
Janne H. Korhonen
Christoph Lenzen
Jukka Suomela
ArXivPDFHTML

Papers citing "Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique"

3 / 3 papers shown
Title
Near-Constant-Time Distributed Algorithms on a Congested Clique
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
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
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Danny Dolev
Christoph Lenzen
Shir Peled
66
111
0
31 Jan 2012
1