Publication:5091074
From MaRDI portal
DOI10.4230/LIPIcs.OPODIS.2018.4MaRDI QIDQ5091074
Dean Leitersdorf, Elia Turner, Keren Censor-Hillel
Publication date: 21 July 2022
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
- Algebraic methods in the congested clique
- Sparse matrix multiplication and triangle listing in the congested clique model
- Gaussian elimination is not optimal
- Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
- On the power of the congested clique model
- Fast sparse matrix multiplication
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- Powers of tensors and fast matrix multiplication
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
- Optimal deterministic routing and sorting on the congested clique
- Distributed approximation algorithms for weighted shortest paths
- Distributed Computation of Large-scale Graph Problems
- Triangle Finding and Listing in CONGEST Networks
- Multiplying matrices faster than coppersmith-winograd
