Faculty profile 2
Research interests include randomized algorithms, sample complexities, and sparse recovery.
SODA best student paper, 2014
George M. Sprowls Award for best computer science doctoral thesis at MIT, 2013
Simons Graduate Fellowship in Theoretical Computer Science, 2012
NSF Graduate Research Fellowship, 2009
A Robust Sparse Fourier Transform in the Continuous Setting, Eric Price and Zhao Song, FOCS 2015
Tight Bounds for Learning a Mixture of Two Gaussians, Moritz Hardt and Eric Price, STOC 2015
The Noisy Power Method: A Meta Algorithm with Applications, Moritz Hardt and Eric Price, NIPS 2014
(Nearly) sample-optimal sparse Fourier transform. Michael Kapralov, Eric Price, and Piotr Indyk, SODA 2014
New constructions of RIP matrices with fast multiplication and fewer rows,Jelani Nelson, Eric Price, and Mary Wootters, SODA 2014
* A Robust Sparse Fourier Transform in the Continuous Setting, FOURIER: Applications of Fourier Analysis to Theoretical Computer Science workshop, FSTTCS, December 2015, Bangalore, India.
* Tight bounds for learning a mixture of two Gaussians, MIT Algorithms and Complexity Seminar, January 2015, Cambridge, MA.
patent no. 9213916. "Compressive Sensing With Local Geometric Features"
By Brian Calvin Gardiner, Rishi Gupta, Piotr Jozef Indyk, Eric Cullen Price, Yaron Rachlin and Chris Yu
PC member, SODA 2016
PC member, RANDOM 2015