On the exact space complexity of sketching and streaming small norms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1161-1178

  Kane, Daniel M ^a   Nelson, Jelani ^b   Woodruff, David P ^c  

^a HARVARD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BOUNDED COMPUTATION; DEFINED FUNCTIONS; DERANDOMIZATION; DIRECT SUM; LOWER BOUNDS; PSEUDORANDOM GENERATORS; SPACE COMPLEXITY; UPPER BOUND;

VECTOR SPACES;

EID: 77951675390     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.93     Document Type: Conference Paper

References (41)

1. Noga Alon, Phillip B. Gibbons, Yossi Matias, and Mario Szegedy. Tracking join and self-join sizes in limited storage. J. Comput. Syst. Sci., 64(3):719-747, 2002.
2. Noga Alon, Yossi Matias, and Mario Szegedy. The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
3. Khanh Do Ba, Piotr Indyk, Eric C. Price, and David P. Woodruff. Lower bounds for sparse recovery. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), to appear, 2010.
4. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar. The sketching complexity of pattern matching. In 8th International Workshop on Randomization and Computation (RANDOM), pages 261-272, 2004.
5. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS), pages 209-218, 2002.
6. Joshua Brody and Amit Chakrabarti. A multi-round communication lower bound for gap hamming and some consequences. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), pages 358-368, 2009.
7. Amit Chakrabarti, Graham Cormode, and Andrew McGregor. A near-optimal algorithm for computing the entropy of a stream. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 328-335, 2007.
8. Amit Chakrabarti, Subhash Khot, and Xiaodong Sun. Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity (CCC), pages 107-117, 2003.
9. John M. Chambers, Colin L. Mallows, and B. W. Stuck. A method for simulating stable random variables. J. Amer. Statist. Assoc., 71:340-344, 1976.
10. Kenneth L. Clarkson and David Woodruff. Numerical linear algebra in the streaming model. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 205-214, 2009.
11. Graham Cormode, Piotr Indyk, Nick Koudas, and S. Muthukrishnan. Fast mining of massive tabular data via approximate distance computations. In Proceedings of the 18th International Conference on Data Engineering (ICDE), pages 605-, 2002.
12. Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco Servedio, and Emanuele Viola. Bounded independence fools halfspaces. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), to appear, 2009.
13. Joan Feigenbaum, Sampath Kannan, Martin Strauss, and Mahesh Viswanathan. An approximate L1-difference algorithm for massive data streams. SIAM J. Comput., 32(1):131-151, 2002.
14. Dan Feldman, Morteza Monemizadeh, Christian Sohler, and David P. Woodruff. Coresets and sketches for high dimensional subspace problems. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), to appear, 2010.
15. Philippe Flajolet and G. Nigel Martin. Probabilistic counting. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 76-82, 1983.
16. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
17. Kurt Otto Friedrichs. The identity of weak and strong extensions of differential operators. Transactions of the American Mathematical Society, 55(1):132-151, 1944.
18. Sumit Ganguly and Graham Cormode. On estimating frequency moments of data streams. In Proceedings of the 11th International Workshop on Randomization and Computation (RANDOM), pages 479-493, 2007.
19. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, and Martin Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC), pages 389-398, 2002.
20. Uffe Haagerup. The best constants in the Khintchine inequality. Studia Math., 70(3):231-283, 1982.
21. Nicholas J. A. Harvey, Jelani Nelson, and Krzysztof Onak. Sketching and streaming entropy via approximation theory. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 489-498, 2008.
22. Piotr Indyk. Algorithms for dynamic geometric problems over data streams. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 373-380, 2004.
23. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, 2006.
24. Piotr Indyk. Sketching, streaming and sublinear-space algorithms, 2007. Graduate course notes available at http://stellar.mit.edu/S/course/6/fa07/6.895/ .
25. T. S. Jayram, Ravi Kumar, and D. Sivakumar. The one-way communication complexity of gap hamming distance. Theory of Computing, 4(1):129-135, 2008.
26. T.S. Jayram and David P. Woodruff. The data stream space complexity of cascaded norms. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), to appear, 2009.
27. ∞ "bump" functions. Manuscript. Available at http://math.mit.edu/ ~stevenj/bump-saddle.pdf.
28. Balachander Krishnamurthy, Subhabrata Sen, Yin Zhang, and Yan Chen. Sketch-based change detection: methods, evaluation, and applications. In Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement (IMC), pages 234-247, 2003. (Pubitemid 40730656)
29. Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, 1997.
30. p (0 < p ≤ 2) using stable random projections. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 10-19, 2008.
31. Ping Li. Compressed counting. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 412-421, 2009.
32. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci., 57(1):37-49, 1998.
33. p sampling with applications. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), to appear, 2010.
34. J. Ian Munro and Mike Paterson. Selection and Sorting with Limited Storage. Theoretical Computer Science, 12(3):315-323, 1980.
35. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, 2005.
36. Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
37. John P. Nolan. Stable Distributions - Models for Heavy Tailed Data. Birkhäuser, 2010. In progress, Chapter 1 online at http://academic2. american.edu/~jpnolan.
38. David P. Woodruff. Optimal space lower bounds for all frequency moments. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 167-175, 2004.
39. David P. Woodruff. Efficient and Private Distance Approximation in the Communication and Streaming Models. PhD thesis, Massachusetts Institute of Technology, 2007.
40. Makoto Yamazato. Unimodality of infinitely divisible distribution functions of class L. Ann. Probability, 6:523-531, 1978.
41. Vladimir Mikhailovich Zolotarev. One-dimensional Stable Distributions. Vol. 65 of Translations of Mathematical Monographs, American Mathematical Society, 1986.