Matrix multiplication in the MPC model

DOI10.1007/978-3-032-17156-6_16MaRDI QIDQ7307325zbMATH OpenFDO

Authors Lakshya Joshi, Arya Deshmukh, Atharv Chhabra, Chetan Gupta

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_16

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Algebraic methods in the congested clique
• Fast approximate shortest paths in the congested clique
• Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
• scientific article; zbMATH DE number 6297759 (Why is no real title available?)
• scientific article; zbMATH DE number 7788370 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• Multiplying matrices faster than coppersmith-winograd
• Powers of tensors and fast matrix multiplication
• Sparse matrix multiplication and triangle listing in the congested clique model

This page was built for publication: Matrix multiplication in the MPC model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307325)