{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:27:55Z","timestamp":1743056875076,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_11","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"127-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interval Selection in the Streaming Model"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S1570-8667(03)00003-0","volume":"1","author":"AZ Broder","year":"2003","unstructured":"Broder, A.Z., Charikar, M., Mitzenmacher, M.: A derandomization using min-wise independent permutations. J. Discrete Algorithms 1(1), 11\u201320 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"11_CR2","unstructured":"Cabello, S., P\u00e9rez-Lantero, P.: Interval selection in the streaming model. arXiv preprint: 1501.02285 (2015). http:\/\/arxiv.org\/abs\/1501.02285"},{"key":"11_CR3","unstructured":"Chakrabarti, A., et al: CS49: Data stream algorithms lecture notes, fall (2011). http:\/\/www.cs.dartmouth.edu\/ ac\/Teach\/CS49-Fall11\/"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45749-6_31","volume-title":"Algorithms - ESA 2002","author":"M Datar","year":"2002","unstructured":"Datar, M., Muthukrishnan, S.M.: Estimating rarity and similarity over data stream windows. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 323\u2013334. Springer, Heidelberg (2002)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-31594-7_26","volume-title":"Automata, Languages, and Programming","author":"Y Emek","year":"2012","unstructured":"Emek, Y., Halld\u00f3rsson, M.M., Ros\u00e9n, A.: Space-constrained interval selection. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 302\u2013313. Springer, Heidelberg (2012)"},{"issue":"2\u20133","key":"11_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2\u20133), 207\u2013216 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-642-14165-2_54","volume-title":"Automata, Languages and Programming","author":"BV Halld\u00f3rsson","year":"2010","unstructured":"Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Losievskaja, E., Szegedy, M.: Streaming algorithms for independent sets. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 641\u2013652. Springer, Heidelberg (2010)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/jagm.2000.1131","volume":"38","author":"P Indyk","year":"2001","unstructured":"Indyk, P.: A small approximately min-wise independent family of hash functions. J. Algorithms 38(1), 84\u201390 (2001)","journal-title":"J. Algorithms"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4086\/toc.2008.v004a006","volume":"4","author":"TS Jayram","year":"2008","unstructured":"Jayram, T.S., Kumar, R., Sivakumar, D.: The one-way communication complexity of hamming distance. Theory of Computing 4(6), 129\u2013135 (2008)","journal-title":"Theory of Computing"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. PODS 2010, pp. 41\u201352 (2010)","DOI":"10.1145\/1807085.1807094"},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AW Kolen","year":"2007","unstructured":"Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: A survey. Naval Research Logistics (NRL) 54(5), 530\u2013543 (2007)","journal-title":"Naval Research Logistics (NRL)"},{"key":"11_CR13","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, New York (1997)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. Foundations and trends in theoretical computer science. Now Publishers (2005)","DOI":"10.1561\/0400000002"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:19:35Z","timestamp":1675138775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}