A PTAS for Computing the Supremum of Gaussian Processes
Making the Long Code Shorter
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Parikshit Gopalan
Boaz Barak
Johan Hastad
Prasad Raghavendra
David Steurer
Beating CountSketch for heavy hitters in insertion streams
Guest column