187 citations · 495 across the 8 of their papers we have counts for
9 papers
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems
Ariful Azad, Oguz Selvitopi, Md Taufique Hussain +2
Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial B…
An Empirical Study of Cycle Toggling Based Laplacian Solvers
Kevin Deweese, John R. Gilbert, Gary Miller +3
We study the performance of linear solvers for graph Laplacians based on the combinatorial cycle adjustment methodology proposed by [Kelner-Orecchia-Sidford-Zhu STOC-13]. The appro…
LiRa: A New Likelihood-Based Similarity Score for Collaborative Filtering
Veronika Strnadova-Neeley, Aydin Buluc, John R. Gilbert +2
Recommender system data presents unique challenges to the data mining, machine learning, and algorithms communities. The high missing data rate, in combination with the large scale…
Mathematical Foundations of the GraphBLAS
Jeremy Kepner, Peter Aaltonen, David Bader +13
The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. Mathematically the Graph- BLAS…
Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems
Erik G. Boman, Kevin Deweese, John R. Gilbert
A new method for solving Laplacian linear systems proposed by Kelner et al. involves the random sampling and update of fundamental cycles in a graph. Kelner et al. proved asymptoti…
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
Jeremy Kepner, David Bader, Aydın Buluc +3
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complex…
Standards for Graph Algorithm Primitives
Tim Mattson, David Bader, Jon Berry +16
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of…
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
Aydin Buluc, John Gilbert
Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic mult…
Highly Parallel Sparse Matrix-Matrix Multiplication
Aydın Buluç, John R. Gilbert
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first…