Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1610.07902
Cited By
A work-efficient parallel sparse matrix-sparse vector multiplication algorithm
25 October 2016
A. Azad
A. Buluç
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A work-efficient parallel sparse matrix-sparse vector multiplication algorithm"
7 / 7 papers shown
Title
UPSCALE: Unconstrained Channel Pruning
Alvin Wan
Hanxiang Hao
K. Patnaik
Yueyang Xu
Omer Hadad
David Guera
Zhile Ren
Qi Shan
67
4
0
17 Jul 2023
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems
A. Azad
Oguz Selvitopi
Md Taufique Hussain
J. Gilbert
A. Buluç
69
26
0
28 Jun 2021
Enterprise-Scale Search: Accelerating Inference for Sparse Extreme Multi-Label Ranking Trees
Philip A. Etter
Kai Zhong
Hsiang-Fu Yu
Lexing Ying
Inderjit Dhillon
49
3
0
04 Jun 2021
FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence
Yongzhe Zhang
A. Azad
Zhenjiang Hu
54
30
0
14 Oct 2019
Optimal algebraic Breadth-First Search for sparse graphs
Paul Burkhardt
10
17
0
07 Jun 2019
GPOP: A cache- and work-efficient framework for Graph Processing Over Partitions
Kartik Lakhotia
Sourav Pati
Rajgopal Kannan
Viktor Prasanna
66
17
0
21 Jun 2018
Implementing Push-Pull Efficiently in GraphBLAS
Carl Yang
A. Buluç
John Douglas Owens
57
38
0
10 Apr 2018
1