{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:10:08Z","timestamp":1738257008311,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693109"},{"type":"electronic","value":"9783540693116"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69311-6_9","type":"book-chapter","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T11:17:46Z","timestamp":1212751066000},"page":"55-66","source":"Crossref","is-referenced-by-count":3,"title":["Estimating Hybrid Frequency Moments of Data Streams"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[]},{"given":"Mohit","family":"Bansal","sequence":"additional","affiliation":[]},{"given":"Shruti","family":"Dube","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1998","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating frequency moments. J. Comp. Sys. and Sc.\u00a058(1), 137\u2013147 (1998)","journal-title":"J. Comp. Sys. and Sc."},{"doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. In: Proceedings of ACM Symposium on Theory of Computing, Princeton, NJ, pp. 209\u2013218 (2002)","key":"9_CR2","DOI":"10.1109\/SFCS.2002.1181944"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45726-7_1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Z. Bar-Yossef","year":"2002","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting Distinct Elements in a Data Stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483. Springer, Heidelberg (2002)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11841036_16","volume-title":"Algorithms \u2013 ESA 2006","author":"L. Bhuvanagiri","year":"2006","unstructured":"Bhuvanagiri, L., Ganguly, S.: Estimating Entropy over Data Streams. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 148\u2013159. Springer, Heidelberg (2006)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/CCC.2003.1214414","volume-title":"Proceedings of 18th IEEE Conference on Computational Complexity","author":"A. Chakrabarti","year":"2003","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. In: Proceedings of 18th IEEE Conference on Computational Complexity, pp. 107\u2013117. IEEE Computer Society, Los Alamitos (2003)"},{"doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Space Efficient Mining of Multigraph Streams. In: Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM 2005, pp. 271\u2013282 (2005)","key":"9_CR6","DOI":"10.1145\/1065167.1065201"},{"issue":"2","key":"9_CR7","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 Database Applications. J. Comp. Sys. and Sc.\u00a031(2), 182\u2013209 (1985)","journal-title":"J. Comp. Sys. and Sc."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/11602613_51","volume-title":"Algorithms and Computation","author":"S. Ganguly","year":"2005","unstructured":"Ganguly, S.: Counting Distinct Items over Update Streams. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 505\u2013514. Springer, Heidelberg (2005)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-74208-1_35","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Ganguly","year":"2007","unstructured":"Ganguly, S., Cormode, G.: On Estimating Frequency Moments of Data Streams. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 479\u2013493. Springer, Heidelberg (2007)"},{"key":"9_CR10","first-page":"281","volume-title":"Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures","author":"P.B. Gibbons","year":"2001","unstructured":"Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, pp. 281\u2013291. ACM, New York (2001)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/SFCS.2000.892082","volume-title":"Procedings of the 41st Symposium on Foundations of Computer Science, (FOCS)","author":"P. Indyk","year":"2000","unstructured":"Indyk, P.: Stable Distributions, Pseudo Random Generators, Embeddings and Data Stream Computation. In: Procedings of the 41st Symposium on Foundations of Computer Science (FOCS), pp. 189\u2013197. IEEE Computer Society, Los Alamitos (2000)"},{"unstructured":"Indyk, P., Woodruff, D.: Optimal Approximations of the Frequency Moments. In: Proceedings of the 37th ACM Symposium on Theory of Computing, 2005 (STOC), pp. 202\u2013208 (2005)","key":"9_CR12"},{"doi-asserted-by":"crossref","unstructured":"Li, P.: Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections (manuscript, 2006)","key":"9_CR13","DOI":"10.1145\/1150402.1150436"},{"unstructured":"McGregor, A.: Open Problems In Data Streams And Related Topics: IITK Workshop On Algorithms For Data Streams (2006), http:\/\/www.cse.iitk.ac.in\/users\/sganguly\/openproblems.pdf","key":"9_CR14"},{"unstructured":"Nolan, J.P.: Stable Distributions, Ch.1 (2006), http:\/\/academic2.american.edu\/~jpnolan","key":"9_CR15"},{"key":"9_CR16","first-page":"167","volume-title":"Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"D.P. Woodruff","year":"2004","unstructured":"Woodruff, D.P.: Optimal space lower bounds for all frequency moments. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 167\u2013175. SIAM, Philadelphia (2004)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69311-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:30Z","timestamp":1738254750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69311-6_9"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693109","9783540693116"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69311-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}