The complexity of approximating entropy
An elementary proof of a theorem of Johnson and Lindenstrauss
Random Structures and Algorithms
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Ronitt Rubinfeld
Ravi Kumar
Tu?kan Batu
Anupam Gupta
Very sparse stable random projections for dimension reduction in l? (0 <? ? 2) norm
Sublinear algorithms for testing monotone and unimodal distributions