Lower bounds for randomized read/write stream algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 689-698

  Beame, Paul ^a   Jayram, T S ^b   Rudra, Atri ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Communication complexity; Data stream algorithms

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTATIONAL METHODS; ERROR ANALYSIS; PROBLEM SOLVING;

DATA STREAM ALGORITHMS; LOGARITHMIC MEMORY; LOWER BOUNDS;

DATA STORAGE EQUIPMENT;

EID: 35448974177     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250891     Document Type: Conference Paper

References (15)

1. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. In 45th Symposium on Foundations of Computer Science (FOCS), pages 540-549, 2004.
2. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In 27th Annual Symposium on Foundations of Computer Science (FOCS), pages 337-347, Toronto, Ontario, Oct. 1986. IEEE.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of the 21st ACM Sympoisum on Principles of Database Systems (PODS), pages 1-16, 2002.
4. P. Beame, M. Saks, X. Sun, and E. Vee. Time-space trade-off lower bounds for randomized computation of decision problems. Journal of the ACM, 50(2):154-195, 2003.
5. J. Chen and C.-K. Yap. Reversal complexity. SIAM J. Comput., 20(4):622-638, 1991.
6. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
7. M. Grohe, A. Hernien, and N. Schweikardt. Randomized computations on large data sets: Tight lower bounds. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), pages 243-252, 2006.
8. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data external memory. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), LNCS3580, pages 1076-1088, 2005.
9. M. Grohe and N. Schweikardt. Lower bounds for sorting with few random accesses to external memory. In Proceedings of the 24th ACM Symposium on Principles of Database Systems (PODS), pages 238-249, 2005.
10. P. Indyk and D. P. Woodruff. Tight lower bounds for the distinct elements problem. In 44th Symposium on Foundations of Computer Science. (FOCS), pages 283-292, 2003.
11. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2006.
12. A. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385-390, 1992.
13. M. Ruhl. Efficient Algorithms for New Computational Models. PhD thesis, Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2003.
14. J. S. Vitter. External memory algorithms and data structures. ACM Comput. Surv., 33(2):209-271, 2001.
15. D. P. Woodruff. Optimal space lower bounds for all frequency moments. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 167-175, 2004.