463 citations · 1k across the 47 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 2 cited
A Two Pronged Progress in Structured Dense Matrix Multiplication
Christopher De Sa, Albert Gu, Rohan Puttagunta +2
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix and a vector , it is known that in the worst case $…
cs.CC2016
Tight Network Topology Dependent Bounds on Rounds of Communication
Arkadev Chattopadhyay, Michael Langberg, Shi Li +1
We prove tight network topology dependent bounds on the round complexity of computing well studied -party functions such as set disjointness and element distinctness. Unlike the…