Algebraic methods in the congested clique

@article{CensorHillel2015AlgebraicMI,
  title={Algebraic methods in the congested clique},
  author={Keren Censor-Hillel and Petteri Kaski and Janne H. Korhonen and Christoph Lenzen and Ami Paz and Jukka Suomela},
  journal={Distributed Computing},
  year={2015},
  pages={1-18}
}
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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
52 Extracted Citations
9 Extracted References
Similar Papers

Similar Papers

Loading similar papers…