21 citations · 94 across the 25 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018★ 1 cited
Optimality of Linear Sketching under Modular Updates
Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
We study the relation between streaming algorithms and linear sketching algorithms, in the context of binary updates. We show that for inputs in dimensions, the existence of ef…
cs.CC2013
The Round Complexity of Small Set Intersection
David P. Woodruff, Grigory Yaroslavtsev
The set disjointness problem is one of the most fundamental and well-studied problems in communication complexity. In this problem Alice and Bob hold sets , res…