On the Representation and Multiplication of Hypersparse Matrices (2008)

Cached

Download Links

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

Active Bibliography

6 Highly Parallel Sparse Matrix-Matrix Multiplication – - 2010
37th International Conference on Parallel Processing Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication ∗
38 Fast Sparse Matrix Multiplication – - 2004
29 All-pairs shortest paths with real weights in O(n³ / log n) time – - 2005
10 All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time – - 2007
14 Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks – - 2009
All-Pairs Shortest Paths with a Sublinear Additive Error
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time – - 2009
10 All-Pairs Bottleneck Paths in Vertex Weighted Graphs – - 2007
7 Fast algorithms for (max,min)-matrix multiplication and bottleneck shortest paths – - 2009
3 Efficient Algorithms for Path Problems in Weighted Graphs – - 2008
Solving Path Problems on the GPU
14 Parallel breadth-first search on distributed memory systems – - 2011
A STREAMING APPROACH FOR SPARSE MATRIX PRODUCTS AND ITS APPLICATION IN GALERKIN MULTIGRID METHODS ∗
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
Foundation. Communication Optimal Parallel Multiplication of Sparse Random Matrices ∗
14 A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers – - 2010
1 Fast algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in graphs with a (not so) small vertex cover
Language Constrained Graph Problems A Microcosm of Engineering Research and Development (Plenary Talk)