activity
20102025
most citedMathematical Foundations of the GraphBLAS

187 citations · 1k across the 59 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.DC2021

Parallel Algorithms for Adding a Collection of Sparse Matrices

Md Taufique Hussain, Guttu Sai Abhishek, Aydin Buluç +1

We develop a family of parallel algorithms for the SpKAdd operation that adds a collection of k sparse matrices. SpKAdd is a much needed operation in many applications including di…

cs.DC2021

Parallel Algorithms for Masked Sparse Matrix-Matrix Products

Srđan Milaković, Oguz Selvitopi, Israt Nisa +2

Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics…

cs.NI2021★ 14 cited

Spatial Temporal Analysis of 40,000,000,000,000 Internet Darkspace Packets

Jeremy Kepner, Michael Jones, Daniel Andersen +24

The Internet has never been more important to our society, and understanding the behavior of the Internet is essential. The Center for Applied Internet Data Analysis (CAIDA) Telesc…

cs.DC2021

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…

cs.AI2021★ 6 cited

Randomized Algorithms for Scientific Computing (RASC)

Aydin Buluc, Tamara G. Kolda, Stefan M. Wild +16

Randomized algorithms have propelled advances in artificial intelligence and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office o…