{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:40:14Z","timestamp":1737322814560,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_60","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"659-669","source":"Crossref","is-referenced-by-count":1,"title":["Two Improved Range-Efficient Algorithms for F 0 Estimation"],"prefix":"10.1007","author":[{"given":"He","family":"Sun","sequence":"first","affiliation":[]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences\u00a058, 137\u2013147 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"60_CR2","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 623\u2013632 (2002)"},{"key":"60_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"L. Trevisan","year":"2002","unstructured":"Trevisan, L., et al.: Counting Distinct Elements in a Data Stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, pp. 1\u201310. Springer, Heidelberg (2002)"},{"issue":"2","key":"60_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Cormode, G., et al.: Comparing data streams using hamming norms (How to zero in). In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 335\u2013345 (2002)","DOI":"10.1016\/B978-155860869-6\/50037-8"},{"key":"60_CR6","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"Algorithms - ESA 2003","author":"S.M. Muthukrishnan","year":"2003","unstructured":"Muthukrishnan, S.M., Cormode, G.: Estimating Dominance Norms of Multiple Data Streams. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 148\u2013160. Springer, Heidelberg (2003)"},{"key":"60_CR7","unstructured":"Cormode, G.: Stable distributions for stream computations: it\u2019s as easy as 0,1,2. In: Workshop on Management and Processing of Massive Data Streams, at FCRC (2003)"},{"key":"60_CR8","series-title":"Lecture Notes in Computer Science","first-page":"605","volume-title":"Algorithms - ESA 2003","author":"P. Flajolet","year":"2003","unstructured":"Flajolet, P., Durand, M.: Loglog Counting of Large Cardinalities. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 605\u2013617. Springer, Heidelberg (2003)"},{"key":"60_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences\u00a031, 182\u2013209 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s00778-004-0135-3","volume":"13","author":"S. Ganguly","year":"2004","unstructured":"Ganguly, S., Garofalakis, M., Rastogi, R.: Tracking set-expression cardinalities over continuous update streams. The International Journal on Very Large Data Bases\u00a013, 354\u2013369 (2004)","journal-title":"The International Journal on Very Large Data Bases"},{"key":"60_CR11","first-page":"157","volume":"AD","author":"F. Giroire","year":"2005","unstructured":"Giroire, F.: Order statistics and estimating cardinalities of massive data sets. Discrete Mathematics and Theoretical Computer Science\u00a0AD, 157\u2013166 (2005)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proceedings of the 40th Symposium on Foundations of Computer Science, pp. 189\u2013197 (2000)","DOI":"10.1109\/SFCS.2000.892082"},{"key":"60_CR13","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Invited talk at 14th ACM-SIAM Symposium on Discrete Algorithms. Available from http:\/\/athos.rutgers.edu\/~muthu\/stream-1-1.ps"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. In: Proceedings of the 22nd Symposium on Theory of Computation, pp. 204\u2013212 (1990)","DOI":"10.1145\/100216.100242"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Pavan, A., Tirthapura, S.: Range-efficient computation of F 0 over massive data stream. In: Proceedings of the 21st International Conference on Data Engineering, pp. 32\u201343 (2005)","DOI":"10.1109\/ICDE.2005.118"},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Science\u00a022, 265\u2013279 (1981)","journal-title":"Journal of Computer and System Science"},{"key":"60_CR17","doi-asserted-by":"crossref","unstructured":"Weron, R.: On the Chambers-Mallows-Stuck method for simulating skewed stable random variables. Technical report, Hugo Steinhaus Center for Stochastic Methods, Wroc\u0142aw (1996)","DOI":"10.1016\/0167-7152(95)00113-1"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:27:01Z","timestamp":1737322021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_60","relation":{},"subject":[]}}