Sciweavers

PODC
2015
ACM

Algebraic Methods in the Congested Clique

7 years 11 months ago
Algebraic Methods in the Congested Clique
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n1−2/ω ) round matrix multiplication algorithm, where ω < 2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:
Keren Censor-Hillel, Petteri Kaski, Janne H. Korho
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where PODC
Authors Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Comments (0)