An information statistics approach to data stream and communication complexity
Algorithmic derandomization via complexity theory
A sieve algorithm for the shortest lattice vector problem
Rank aggregation methods for the Web
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01
Journal of Computer and System Sciences
Proceedings of the tenth international conference on World Wide Web - WWW ’01
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Ravi Kumar
Moni Naor
Cynthia Dwork
T.S. Jayram
Miklós Ajtai
Ziv Bar-Yossef
Streaming symmetric norms via measure concentration
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Generalized Decision Scoring Rules
(Gap/S)ETH hardness of SVP
Beating CountSketch for heavy hitters in insertion streams