{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:40Z","timestamp":1725600340636},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_37","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T05:20:39Z","timestamp":1313126439000},"page":"436-447","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Algorithms with One-Sided Estimation"],"prefix":"10.1007","author":[{"given":"Joshua","family":"Brody","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Ba, K.D., Indyk, P., Woodruff, D.: Efficient sketches for earth-mover distance, with applications. In: Proc. 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 324\u2013330 (2009)","DOI":"10.1109\/FOCS.2009.25"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Krauthgamer, R.: Overcoming the \u21131 non-embeddability barrier: Algorithms for product metrics. In: SODA (2009)","DOI":"10.1137\/1.9781611973068.94"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proc. 30th Annual ACM Symposium on the Theory of Computing, pp. 63\u201368 (1998)","DOI":"10.1145\/276698.276713"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Hazan, E., Woodruff, D.P.: Sublinear optimization for machine learning. In: Proc. 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 449\u2013457 (2010)","DOI":"10.1109\/FOCS.2010.50"},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Alg.\u00a055(1), 58\u201375 (2005); preliminary version in Proc. 6th Latin American Theoretical Informatics Symposium, pp. 29\u201338 (2004)","journal-title":"J. Alg."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Space efficient mining of multigraph streams. In: Proc. 24th ACM Symposium on Principles of Database Systems, pp. 271\u2013282 (2005)","DOI":"10.1145\/1065167.1065201"},{"key":"37_CR7","unstructured":"Erg\u00fcn, F., Jowhari, H.: On distance to monotonicity and longest increasing subsequence of a data stream. In: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 730\u2013736 (2008)"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0378-3758(80)90032-4","volume":"4","author":"O. Frank","year":"1980","unstructured":"Frank, O.: Estimation of the number of vertices of different degrees in a graph. Journal of Statistical Planning and Inference\u00a04(1), 45\u201350 (1980)","journal-title":"Journal of Statistical Planning and Inference"},{"issue":"1","key":"37_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1090\/S0002-9947-1987-0871675-6","volume":"300","author":"P. Frankl","year":"1987","unstructured":"Frankl, P., R\u00f6dl, V.: Forbidden intersections. Trans. Amer. Math. Soc.\u00a0300(1), 259\u2013286 (1987)","journal-title":"Trans. Amer. Math. Soc."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"G\u00e1l, A., Gopalan, P.: Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. In: Proc. 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 294\u2013304 (2007)","DOI":"10.1109\/FOCS.2007.54"},{"key":"37_CR11","unstructured":"Gopalan, P., Jayram, T.S., Krauthgamer, R., Kumar, R.: Estimating the sortedness of a data stream. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 318\u2013327 (2007)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithms for dynamic geometric problems over data streams. In: Proc. 36th Annual ACM Symposium on the Theory of Computing, pp. 373\u2013380 (2004)","DOI":"10.1145\/1007352.1007413"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Jayram, T., Woodruff, D.P.: The data stream space complexity of cascaded norms. In: FOCS, pp. 765\u2013774 (2009)","DOI":"10.1109\/FOCS.2009.82"},{"key":"37_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Schmidt, E.M.: Las vegas is better than determinism in vlsi and distributed computing (extended abstract). In: Proc. 14th Annual ACM Symposium on the Theory of Computing, pp. 330\u2013337 (1982)","DOI":"10.1145\/800070.802208"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Monemizadeh, M., Woodruff, D.P.: 1-pass relative-error l p sampling with applications. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1143\u20131160 (2010)","DOI":"10.1137\/1.9781611973075.92"},{"issue":"2","key":"37_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science\u00a01(2), 117\u2013236 (2005)","journal-title":"Foundations and Trends in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22935-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T21:03:31Z","timestamp":1560459811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}