{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:51:54Z","timestamp":1725688314329},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311543"},{"type":"electronic","value":"9783642311550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31155-0_30","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T22:21:27Z","timestamp":1339539687000},"page":"340-351","source":"Crossref","is-referenced-by-count":1,"title":["Competitive Analysis of Maintaining Frequent Items of a Stream"],"prefix":"10.1007","author":[{"given":"Yiannis","family":"Giannakopoulos","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.: Data Streams: Models and Algorithms. Advances in Database Systems. Springer (2007)","DOI":"10.1007\/978-0-387-47534-9"},{"issue":"1","key":"30_CR2","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(1), 137\u2013147 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. ACM SIGecom Exchanges\u00a07(2), 1\u201311 (2008)","journal-title":"ACM SIGecom Exchanges"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2010.09.007","volume":"5","author":"L. Becchetti","year":"2011","unstructured":"Becchetti, L., Chatzigiannakis, I., Giannakopoulos, Y.: Streaming techniques and data aggregation in networks of tiny artefacts. Computer Science Review\u00a05(1), 27\u201346 (2011)","journal-title":"Computer Science Review"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-02927-1_15","volume-title":"Automata, Languages and Programming","author":"L. Becchetti","year":"2009","unstructured":"Becchetti, L., Koutsoupias, E.: Competitive Analysis of Aggregate Max in Windowed Streaming. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 156\u2013170. Springer, Heidelberg (2009)"},{"key":"30_CR6","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"30_CR7","unstructured":"Boyer, R.S., Moore, J.S.: MJRTY-A Fast Majority Vote Algorithm. Technical report, Texas University at Austin, Insitute for Computing Science and Computer Applications (1981)"},{"issue":"2","key":"30_CR8","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.14778\/1454159.1454225","volume":"1","author":"G. Cormode","year":"2008","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. Proceedings of the VLDB Endowment\u00a01(2), 1530\u20131541 (2008)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 635\u2013644 (2002)","DOI":"10.1137\/S0097539701398363"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T.S. Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who solved the secretary problem? Statistical Science\u00a04(3), 282\u2013296 (1989)","journal-title":"Statistical Science"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Online Algorithms","year":"1998","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online Algorithms 1996. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"key":"30_CR12","unstructured":"Gama, J., Geber, M.M. (eds.): Learning from Data Streams: Processing Techniques in Sensor Networks. Springer (2007)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Liu, L., Tamer Ozsu, M. (eds.): Encyclopedia of Database Systems. Springer (2009)","DOI":"10.1007\/978-0-387-39940-9"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming\u00a02(2), 143\u2013152 (1982)","journal-title":"Science of Computer Programming"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. In: Proceedings of FOCS 1978, pp. 253\u2013258 (1978)","DOI":"10.1109\/SFCS.1978.32"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. Now Publishers Inc. (2005)","DOI":"10.1561\/0400000002"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of FOCS 1977, pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"},{"issue":"2","key":"30_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2151171.2151175","volume":"8","author":"K. Yi","year":"2012","unstructured":"Yi, K., Zhang, Q.: Multidimensional online tracking. ACM Trans. Algorithms\u00a08(2), 12:1\u201312:16 (2012)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31155-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:48:37Z","timestamp":1620114517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31155-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311543","9783642311550"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31155-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}