Sparse Matrix Multiplication and Triangle Listing in the Congested
Clique Model

v1v2v3v4 (latest)

Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model

13 February 2018

K. Censor-Hillel

Dean Leitersdorf

ArXiv (abs)PDF HTML

Papers citing "Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model"

10 / 10 papers shown

Title
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique Andrzej Lingas 60 1 0 25 May 2024
Improved All-Pairs Approximate Shortest Paths in Congested Clique Hong Duc Bui Shashwat Chandra Yi-Jun Chang Michal Dory Dean Leitersdorf 84 2 0 04 May 2024
Distributed Subgraph Finding: Progress and Challenges K. Censor-Hillel 56 14 0 13 Mar 2022
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 137 28 0 19 Jan 2021
On Distributed Listing of Cliques K. Censor-Hillel F. Gall Dean Leitersdorf 44 24 0 10 Jul 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 88 30 0 15 Jun 2020
Input-Dynamic Distributed Algorithms for Communication Networks Klaus-Tycho Foerster Janne H. Korhonen A. Paz Joel Rybicki Stefan Schmid 38 3 0 15 May 2020
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 131 23 0 06 Mar 2020
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration Yi-Jun Chang Thatchaphol Saranurak 51 51 0 17 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 56 54 0 14 Mar 2019