Reductions in streaming algorithms, with an application to counting triangles in graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 623-632

  Bar Yossef, Ziv ^a   Kumar, Ravi ^b   Sivakumar, D ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

APPROXIMATION FACTOR; DATA STREAM; DISTINCT ELEMENTS; NUMBER OF TRIANGLES; STREAMING ALGORITHM; STREAMING MODEL;

ALGORITHMS;

EID: 20744439022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [AMS99] N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS, 58(1):137-147, 1999.
2. [AYZ97] N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997.
3. [BabOl] S. Babu. Work related to STREAM project, 2001. http://www-db.stanford.edu/stream/related.html.
4. [CW79] J. L. Carter and M. N. Wegman. Universal classes of hash functions. JCSS, 18(2): 143-154, 1979.
5. [Dic58] L. E. Dickson. Linear Groups with an Exposition of the Galois Field Theory. Dover, 1958.
6. [EIO01] L. Engebretsen, P. Indyk, and R. O'Donnell. De-randomized dimensionality reduction with applications. Proc. 13th SODA, 2002.
7. [FKSV99] J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate Lx-difference algorithm for massive data streams. Proc. 40th FOCS, pp. 501-511, 1999.
8. [FM85] P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. JCSS, 31(2):182-209, 1985.
9. [FS00] J. Fong and M. Strauss. An approximate lp-difference algorithm for massive data streams. Proc. STACS, pp. 193-204, 2000.
10. [GKMS01] A. C. Gilbert, Y. Kotidis, S. Muthuskrish-nan, and M. J. Strauss. A few good terms: Efficient streaming computation of wavelet decompositions. Manuscript, 2001.
11. [Gol97] O. Goldreich. A sample of samplers -a computational perspective on sampling (survey). ECCC, TR97-020, 1997.
12. [GKS01] S. Guha, N. Koudas, and K. Shim. Data streams and histograms. Proc. 33rd STOC, pp. 471-475, 2001.
13. [HRR99] M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. DIM ACS series in Discr. Math. & Theor. Comp. Sc., 50:107-118, 1999.
14. [IndOO] P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proc. 41st FOCS, pp. 189-197, 2000.
15. [KN97] E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
16. [NW94] N. Nisan and A. Wigderson. Hardness vs. randomness. JCSS, 49(2): 149-167, 1994.
17. [Sip83] M. Sipser. A complexity theoretic approach to randomness. Proc. 15th STOC, pp. 330-335, 1983.
18. [SivOl] D. Sivakumar. Algorithmic derandomization via complexity theory. Manuscript, 2001.
19. [Sto83] L. J. Stockmeyer. The complexity of approximate counting. Proc. 15th STOC, pp. 118-126, 1983.
20. [TreOl] L. Trevisan. A note on counting distinct elements in the streaming model. Manuscript, 2001.
21. [Yao77] A.C-C. Yao. Probabilistic computations: toward a unified measure of complexity. Proc. 18th FOCS, pp. 222-227, 1977.