{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:26Z","timestamp":1725456986002},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_10","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"64-74","source":"Crossref","is-referenced-by-count":0,"title":["Precision vs Confidence Tradeoffs for \u21132-Based Frequency Estimation in Data Streams"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theoretical Computer Science\u00a0312(1), 3\u201315 (2004)","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11780823_22","volume-title":"Structural Information and Communication Complexity","author":"G. Cormode","year":"2006","unstructured":"Cormode, G., Muthukrishnan, S.: Combinatorial Algorithms for Compressed Sensing. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 280\u2013294. Springer, Heidelberg (2006)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11590156_24","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"S. Ganguly","year":"2005","unstructured":"Ganguly, S., Kesh, D., Saha, C.: Practical Algorithms for Tracking Database Join Sizes. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 297\u2013309. Springer, Heidelberg (2005)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Li, Y., Porat, E., Strauss, M.J.: Approximate sparse recovery: optimizing time and measurements. In: Proceedings of ACM Symposium on Theory of Computing, STOC, pp. 475\u2013484 (2010)","DOI":"10.1145\/1806689.1806755"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Price, E., Woodruff, D.: (1\u2009+\u2009\u03b5)-approximate Sparse Recovery. In: Proceedings of IEEE Foundations of Computer Science (FOCS) (2011)","DOI":"10.1109\/FOCS.2011.92"},{"key":"10_CR6","unstructured":"Schmidt, J., Siegel, A., Srinivasan, A.: Chernoff-Hoeffding Bounds with Applications for Limited Independence. In: Proceedings of ACM Symposium on Discrete Algorithms (SODA), pp. 331\u2013340 (1993)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:05:58Z","timestamp":1557446758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}