6 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.DS2010★ 1 cited
Sublinear Time, Measurement-Optimal, Sparse Recovery For All
Ely Porat, Martin J. Strauss
An approximate sparse recovery system in ell_1 norm formally consists of parameters N, k, epsilon an m-by-N measurement matrix, Phi, and a decoding algorithm, D. Given a vector, x,…
cs.CR2006★ 1 cited
Private Approximate Heavy Hitters
Martin J. Strauss, Xuan Zheng
We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along w…
cs.DS2006★ 6 cited
List decoding of noisy Reed-Muller-like codes
A. R. Calderbank, Anna C. Gilbert, Martin J. Strauss
First- and second-order Reed-Muller (RM(1) and RM(2), respectively) codes are two fundamental error-correcting codes which arise in communication as well as in probabilistically-ch…