Improved range-summable random variable construction algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 840-849

  Calderbank, A R ^a   Gilbert, A ^b   Levchenko, K ^c   Muthukrishnan, S ^d   Strauss, M ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM ALGORITHMICS; HASH FUNCTIONS; POLYLOGARITHMIC; REED-MULLER CODES;

BINARY CODES; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; WAVELET TRANSFORMS;

ALGORITHMS;

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

References (22)

1. N. Alon, P. Gibbons, Y. Matias, and M. Szegedy. Tracking Join and Self-Join Sizes in Limited Storage. ACM Principles of Database Systems conference, 10-20 (1999).
2. th Annual ACM Symposium on the Theory of Computing, 20-29 (1996).
3. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs. SODA 2002.
4. J. L. Carter and M. N. Wegman. Universal Classes of Hash Functions. J. of Comp. and Syst. Sci. 18, 143-154 (1979).
5. M. Charikar, K. Chen, and M. Farach-Colton. Finding Frequent Items in Data Streams. Proc. of the 29th International Colloquium on Automata Languages and Programming (2002).
6. G. Cormode, S. Muthukrishnan. Estimating Dominance Norms of Multiple Data Streams. ESA 2003: 148-160.
7. G. Cormode and S. Muthukrishnan. Improved Data Stream Summary: The Count-Min Sketch and its Applications. DIMACS Technical Report 2003-20, June 2003.
8. LATIN 2004. To appear in J. Algorithms.
9. 1-Difference Algorithm for Massive Data Streams. IEEE Symp. on Foundations of Computer Science, 1999.
10. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. One-Pass Wavelet Decompositions of Data Streams. IEEE Transactions on Knowledge and Data Engineering, 15 (3), 2003.
11. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. STOC 2002: 389-398.
12. O. Goldreich, S. Goldwasser and A. Nussboim. On the implementation of huge random objects. ECCC eport TR03-045.
13. D. Knuth. Art of computer programming: Sorting and Searching. Vol3. Addison Wesley. 1st Edition.
14. M. Luby and A. Wigderson. Pairwise independence and derandomization. Survey. ICSI TR-95-035 UC Berkeley UCB/CSD-95-880 Ecole Normale Superieure LIENS-95-22. 1995.
15. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.
16. S. Muthukrishnan. Data stream algorithms. http://www.cs.rutgers.edu/ ~muthu/stream-1-1.ps
17. S. Muthukrishnan, M. Strauss. Maintenance of Multidimensional Histograms. FSTTCS 2003: 352-362
18. S. Muthukrishnan, M. Strauss. Rangesum histograms. SODA 2003: 233-242.
19. J. Naor, M. Naor. Small-Bias Probability Spaces: Efficient Constructions and Applications, SIAM J. Comput. 22(4): 838-856 (1993).
20. th Annual ACM Symposium on the Theory of Computing. 330-335 (1983).
21. M. N. Wegman and J. L. Carter. New Hash Functions and Their Use in Authentication and Set Equality. J. of Comp. and Syst. Sci. 22, 265-279 (1981).
22. A. Wigderson. The amazing power of pairwise independence (abstract). STOC 1994: 645-647