{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:36:57Z","timestamp":1774597017294,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029264","type":"print"},{"value":"9783642029271","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02927-1_15","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"156-170","source":"Crossref","is-referenced-by-count":10,"title":["Competitive Analysis of Aggregate Max in Windowed Streaming"],"prefix":"10.1007","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195290017","volume":"14","author":"M. Ajtai","year":"2000","unstructured":"Ajtai, M., Megiddo, N., Waarts, O.: Improved algorithms and analysis for secretary problems and generalizations. SIAM Journal on Discrete Mathematics\u00a014(1), 1\u201327 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proc. of the ACM Symposium on the Theory of Computing, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2004), pp. 286\u2013296. ACM Press, New York (2004)","DOI":"10.1145\/1055558.1055598"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/773153.773176","volume-title":"Proc. of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS 2003)","author":"B. Babcock","year":"2003","unstructured":"Babcock, B., Datar, M., Motwani, R., O\u2019Callaghan, L.: Maintaining variance and k-medians over data stream windows. In: Proc. of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS 2003), pp. 234\u2013243. ACM Press, New York (2003)"},{"key":"15_CR5","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"15_CR6","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Braverman, V., Ostrovsky, R.: Smooth histograms for sliding windows. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 283\u2013293 (2007)","DOI":"10.1109\/FOCS.2007.55"},{"key":"15_CR8","unstructured":"Braverman, V., Ostrovsky, R., Zaniolo, C.: Succinct sampling on streams. Computing Research Repository (CoRR), abs\/cs\/0702151 (2007)"},{"key":"15_CR9","first-page":"1184","volume-title":"Proceedings of the nineteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)","author":"A.Z. Broder","year":"2008","unstructured":"Broder, A.Z., Kirsch, A., Kumar, R., Mitzenmacher, M., Upfal, E., Vassilvitskii, S.: The hiring problem and lake wobegon strategies. In: Proceedings of the nineteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1184\u20131193. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-30551-4_23","volume-title":"Algorithms and Computation","author":"T.M. Chan","year":"2004","unstructured":"Chan, T.M., Sadjad, S.B.S.: Geometric optimization problems over sliding windows. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 246\u2013258. Springer, Heidelberg (2004)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst.\u00a030(1), 249\u2013278 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1137\/S0097539701398363","volume":"31","author":"M. Datar","year":"2002","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM Journal of Computing\u00a031(6), 1794\u20131813 (2002)","journal-title":"SIAM Journal of Computing"},{"key":"15_CR13","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.: Estimating rarity and similarity over data stream windows. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 323\u2013334. Springer, Heidelberg (2002)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R. El-yaniv","year":"2001","unstructured":"El-yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica\u00a030, 101\u2013139 (2001)","journal-title":"Algorithmica"},{"key":"15_CR15","first-page":"28","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2003)","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2003), pp. 28\u201336. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-004-1105-2","volume":"41","author":"J. Feigenbaum","year":"2004","unstructured":"Feigenbaum, J., Kannan, S., Zhang, J.: Computing diameter in the streaming and sliding-window models. Algorithmica\u00a041(1), 25\u201341 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"15_CR17","first-page":"282","volume":"3","author":"T.S. Ferguson","year":"1988","unstructured":"Ferguson, T.S.: Who solved the secretary problem? Statistical Science\u00a03(4), 282\u2013296 (1988)","journal-title":"Statistical Science"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/948205.948227","volume-title":"Proceedings of the 3rd ACM SIGCOMM conference on Internet Measurement (IMC 2003)","author":"L. Golab","year":"2003","unstructured":"Golab, L., DeHaan, D., Demaine, E.D., Lopez-Ortiz, A., Munro, J.I.: Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of the 3rd ACM SIGCOMM conference on Internet Measurement (IMC 2003), pp. 173\u2013178. ACM Press, New York (2003)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1142351.1142390","volume-title":"Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2006)","author":"S. Guha","year":"2006","unstructured":"Guha, S., McGregor, A.: Approximate quantiles and the order of the stream. In: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2006), pp. 273\u2013279. ACM, New York (2006)"},{"key":"15_CR20","first-page":"630","volume-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2005)","author":"R. Kleinberg","year":"2005","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2005), pp. 630\u2013631. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/1142351.1142393","volume-title":"Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2006)","author":"L.K. Lee","year":"2006","unstructured":"Lee, L.K., Ting, H.F.: A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2006), pp. 290\u2013297. ACM, New York (2006)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1109\/ICDE.2005.68","volume-title":"Proceedings of the 21st International Conference on Data Engineering (ICDE 2005)","author":"A. Manjhi","year":"2005","unstructured":"Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (recently) frequent items in distributed data streams. In: Proceedings of the 21st International Conference on Data Engineering (ICDE 2005), pp. 767\u2013778. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Now Publishers Inc. (2005)","DOI":"10.1561\/0400000002"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T02:53:25Z","timestamp":1558407205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}