Documents Related by Co-Citation

699 The space complexity of approximating the frequency moments – Noga Alon, Yossi Matias, Mario Szegedy - 1996
262 Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation – Piotr Indyk - 2000
252 Clustering Data Streams – Sudipto Guha, et al. - 2000
10 An approximate L - dierence algorithm for massive data streams – J Feigenbaum, S Kannan, M Strauss, M Viswanathan - 1999
87 An approximate L1-difference algorithm for massive data streams – J Feigenbaum, S Kannan, M Strauss, M Viswanathan - 2000
129 Data-Streams and Histograms – Sudipto Guha, Nick Koudas, Kyuseok Shim - 2001
194 Surfing wavelets on streams: One-pass summaries for approximate aggregate queries – Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin J. Strauss - 2001
67 Probabilistic counting – P Flajolet, G N Martin - 1983
118 M.S.: Selection and sorting with limited storage – J I Munro, Paterson - 1978
610 Multiparty Communication Complexity – Danny Dolev, Tom├ís Feder - 1989
108 Synopsis Data Structures for Massive Data Sets – Phillip B. Gibbons, Yossi Matias
105 small-space algorithms for approximate histogram maintenance – Fast - 2002
113 Approximate Medians and other Quantiles in One Pass and with Limited Memory – Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G. Lindsay - 1998
112 Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs – Ziv Bar-yossef, Ravi Kumar, D. Sivakumar
59 Hancock: A language for extracting signatures from data streams – Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers, Frederick Smith - 2000
257 Random sampling with a reservoir – Jeffrey Scott Vitter - 1985
319 Primal-dual approximation algorithms for metric facility location and k-median problems – Vijay V. Vazirani - 1999
205 Improved Combinatorial Algorithms for the Facility Location and k-Median Problems – Moses Charikar, Sudipto Guha - 1999
40 Pass Efficient Algorithms for Approximating Large Matrices – Petros Drineas , Ravi Kannan - 2003