## Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation (2000)

### Cached

### Download Links

- [theory.stanford.edu]
- [www.cs.dartmouth.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 261 - 14 self |

### BibTeX

@MISC{Indyk00stabledistributions,,

author = {Piotr Indyk},

title = {Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: ffl we show how to maintain (using only O(log n=ffl 2 ) words of storage) a sketch C(p) of a point p 2 l n 1 under dynamic updates of its coordinates, such that given sketches C(p) and C(q) one can estimate jp \Gamma qj 1 up to a factor of (1 + ffl) with large probability. This solves the main open problem of [10]. ffl we obtain another sketch function C 0 which maps l n 1 into a normed space l m 1 (as opposed to C), such that m = m(n) is much smaller than n; to our knowledge this is the first dimensionality reduction lemma for l 1 norm ffl we give an explicit embedding of l n 2 into l n O(log n) 1 with distortion (1 + 1=n \Theta(1) ) and a nonconstructive embedding of l n 2 into l O(n) 1 with distortion (1 + ffl) such that the embedding can be represented using only O(n log 2 n) bits (as opposed to at least...