Approximating the cut-norm via Grothendieck’s inequality
Every Monotone Graph Property Is Testable
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
Problems and results in extremal combinatorics—I
Approximating the Cut-Norm via Grothendieck’s Inequality
A Graph-Theoretic Game and Its Application to the k-Server Problem
SIAM Journal on Computing
Journal of Computer and System Sciences
Combinatorica
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Ravi Kannan
Marek Karpinski
Asaf Shapira
Yossi Matias
Mario Szegedy
Assaf Naor
Sampling from large matrices
Stable distributions, pseudorandom generators, embeddings, and data stream computation
How robust are linear sketches to adaptive inputs?
Bypassing the embedding
Beating CountSketch for heavy hitters in insertion streams
Bypassing UGC from Some Optimal Geometric Inapproximability Results