Min-Wise Independent Permutations
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
Finding frequent items in data streams
On-Line Load Balancing for Related Machines
On the impossibility of dimension reduction in l1
Journal of Computer and System Sciences
Journal of the ACM
Theoretical Computer Science
Journal of Algorithms
SIAM Journal on Computing
Rajsekar Manokaran
Kevin Chen
Marek Karpinski
Prasad Raghavendra
Venkatesan Guruswami
Michael Mitzenmacher
Online load balancing on related machines
Very sparse stable random projections for dimension reduction in l? (0 <? ? 2) norm
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Bypassing the embedding
Beating CountSketch for heavy hitters in insertion streams
Bypassing UGC from Some Optimal Geometric Inapproximability Results