{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:05:27Z","timestamp":1742969127505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_9","type":"book-chapter","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T01:26:28Z","timestamp":1467595588000},"page":"101-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Know When to Persist: Deriving Value from a Stream Buffer"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Karakostas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Jayram, T.S., Kumar, R., Sivakumar, D.: Approximate counting of inversions in a data stream. In: Reif, J.H. (ed.) Proceedings of 34th Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 19\u201321 May 2002, pp. 370\u2013379. ACM (2002)","DOI":"10.1145\/509907.509964"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Duffield, N., Lund, C., Thorup, M.: Estimating arbitrary subset sums with few probes. In: ACM (ed.) Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 2005, Baltimore, Maryland, 13\u201315 June 2005, pp. 317\u2013325. ACM Press (2005)","DOI":"10.1145\/1065167.1065209"},{"issue":"1","key":"9_CR3","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. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR4","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 434\u2013443. SIAM (2007)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2500121","volume":"9","author":"Mohammadhossein Bateni","year":"2013","unstructured":"Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4), Art. 32, 23 (2013)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jmp.2005.11.003","volume":"50","author":"JN Bearden","year":"2006","unstructured":"Bearden, J.N.: A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psychol. 50(1), 58\u201359 (2006)","journal-title":"J. Math. Psychol."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S., Rozenbaum, I.: Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In: B\u00f6hm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.-\u00c5., Ooi, B.C. (eds.) VLDB, pp. 25\u201336. ACM (2005)","DOI":"10.1137\/1.9781611972757.5"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: Shoham, Y., Chen, Y., Roughgarden, T. (eds.) EC, pp. 29\u201338. ACM (2011)","DOI":"10.1145\/1993574.1993581"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"TS Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who solved the secretary problem? Stat. Sci. 4, 282\u2013289 (1989)","journal-title":"Stat. Sci."},{"key":"9_CR10","first-page":"189","volume":"51","author":"PR Freeman","year":"1983","unstructured":"Freeman, P.R.: The secretary problem and its extensions: a review. Int. Stat. Rev.\/Revue Internationale de Statistique 51, 189\u2013206 (1983)","journal-title":"Int. Stat. Rev.\/Revue Internationale de Statistique"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Karakostas, G., Kranakis, E., Krizanc, D.: Know when to persist: deriving value from a stream buffer. CoRR, abs\/1604.03009 (2016)","DOI":"10.1007\/978-3-319-41168-2_9"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1214\/aop\/1176996090","volume":"4","author":"J Gianini","year":"1976","unstructured":"Gianini, J., Samuels, S.M.: The infinite secretary problem. Ann. Probab. 4, 418\u2013432 (1976)","journal-title":"Ann. Probab."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Mehrotra, S., Sellis, T.K. (eds.) SIGMOD Conference, pp. 58\u201366. ACM (2001)","DOI":"10.1145\/376284.375670"},{"key":"9_CR14","unstructured":"Hoffman, M., Muthukrishnan, S., Raman, R.: Location streams: Models and algorithms. Technical report, DIMACS TR (2004)"},{"key":"9_CR15","unstructured":"Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA, pp. 630\u2013631. SIAM (2005)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Bernstein, P.A., et al. (eds.) VLDB 2002: Proceedings of the Twenty-Eighth International Conference on Very Large Data Bases, Hong Kong SAR, China, 20\u201323 August 2002, pp. 346\u2013357. Morgan Kaufmann Publishers (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"2","key":"9_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications, vol. 1 (2005)","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data stream algorithms (notes from a series of lectures). In: The 2009 Barbados Workshop on Computational Complexity, 1\u20138 March 2009","DOI":"10.1201\/9781584888239-c19"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"620","DOI":"10.2307\/3212880","volume":"12","author":"M Smith","year":"1975","unstructured":"Smith, M.: A secretary problem with uncertain employment. J. Appl. Probab. 12, 620\u2013624 (1975)","journal-title":"J. Appl. Probab."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T03:20:16Z","timestamp":1692415216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_9"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergamo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}