Space lower bounds for distance approximation in the data stream model

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 360-369

  Saks, Michael ^a   Sun, Xiaodong ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FOURIER TRANSFORMS; INFORMATION THEORY; MATHEMATICAL MODELS; VECTORS;

COMMUNICATION COMPLEXITY; DATA STREAM MODEL; DISTANCE APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 0036038680     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509963     Document Type: Conference Paper

References (13)

1. The space complexity of approximating the frequency moments
2. Complexity classes in communication complexity theory (preliminary version)
3. Information theory methods in communication complexity
4. 1-difference algorithm for massive data streams
5. p-difference algorithm for massive data streams
6. Stable distributions, Pseudorandom generators, embeddings and data stream computation
7. The probabilistic communication complexity of set intersection (preliminary version)
8. Extensions of Lipshitz mapping into Hilbert space
9. On the distributed complecity of disjointness
10. Lower bounds by probabilistic arguments