On the Representation and Multiplication of Hypersparse Matrices (2008)

Cached

Download Links

by Aydın Buluç , John R. Gilbert
Citations:9 - 7 self

Active Bibliography

6 Highly Parallel Sparse Matrix-Matrix Multiplication – Aydın Buluç, John R. Gilbert - 2010
37th International Conference on Parallel Processing Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication ∗ – Aydın Buluç, John R. Gilbert
36 Fast Sparse Matrix Multiplication – Raphael Yuster, Uri Zwick - 2004
29 All-pairs shortest paths with real weights in O(n³ / log n) time – Timothy M. Chan - 2005
9 All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time – Virginia Vassilevska, Ryan Williams, Raphael Yuster - 2007
13 Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks – Aydın Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson - 2009
All-Pairs Shortest Paths with a Sublinear Additive Error – Liam Roditty, Asaf Shapira
8 All-Pairs Bottleneck Paths in Vertex Weighted Graphs – Asaf Shapira, Raphael Yuster, Uri Zwick - 2007
6 Fast algorithms for (max,min)-matrix multiplication and bottleneck shortest paths – Ran Duan, Seth Pettie - 2009
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time – Virginia Vassilevska, Ryan Williams, Raphael Yuster - 2009
2 Efficient Algorithms for Path Problems in Weighted Graphs – Virginia Vassilevska - 2008
Solving Path Problems on the GPU – Aydın Buluç A, John R. Gilbert A, Ceren Budak A
14 Parallel breadth-first search on distributed memory systems – Aydın Buluç, Kamesh Madduri - 2011
A STREAMING APPROACH FOR SPARSE MATRIX PRODUCTS AND ITS APPLICATION IN GALERKIN MULTIGRID METHODS ∗ – Joachim Georgii, Rüdiger Westermann
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 431–438 ISBN 978-83-60810-22-4 Cache-Aware Matrix Multiplication on Multicore Systems for IPM-based LP Solvers – Mujahed Eleyat, Miriam As Halden, Lasse Natvig, Jørn Amundsen
Foundation. Communication Optimal Parallel Multiplication of Sparse Random Matrices ∗ – Grey Ballard, Aydin Buluc, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo, Grey Ballard, Aydın Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Sivan Toledo
13 A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers – Charles E. Leiserson, Tao B. Schardl - 2010
1 Fast algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in graphs with a (not so) small vertex cover – Noga Alon, Raphael Yuster
Language Constrained Graph Problems A Microcosm of Engineering Research and Development (Plenary Talk) – Phillip G. Bradford