9 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.DS2021★ 1 cited
A Simple Proof of a New Set Disjointness with Applications to Data Streams
Akshay Kamath, Eric Price, David P. Woodruff
The multiplayer promise set disjointness is one of the most widely used problems from communication complexity in applications. In this problem there are players with subsets $…
cs.DS2019★ 9 cited
Lower Bounds for Compressed Sensing with Generative Models
Akshay Kamath, Sushrut Karmalkar, Eric Price
The goal of compressed sensing is to learn a structured signal from a limited number of noisy linear measurements . In traditional compressed sensing, "structure"…