{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:17:31Z","timestamp":1740097051222,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_40","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"465-476","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Sorting of Data Streams with Limited Storage"],"prefix":"10.1007","author":[{"given":"Farzad","family":"Farnoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. 21st ACM Symp. Principles of Database Systems (PODS), New York, NY, USA (2002)","DOI":"10.1145\/543613.543615"},{"key":"40_CR2","first-page":"720","volume-title":"ACM-SIAM Symp. Discrete Algorithms (SODA)","author":"A. Chakrabarti","year":"2008","unstructured":"Chakrabarti, A., Jayram, T.S., P\u01cetra\u015fcu, M.: Tight lower bounds for selection in randomly ordered streams. In: ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 720\u2013729. Society for Industrial and Applied Mathematics, Philadelphia (2008), http:\/\/dl.acm.org\/citation.cfm?id=1347082.1347161"},{"issue":"1","key":"40_CR3","first-page":"41","volume":"1","author":"C.P. Chen","year":"2008","unstructured":"Chen, C.P., Qi, F.: The best lower and upper bounds of harmonic sequence. Global Journal of Applied Mathematics and Mathematical Sciences\u00a01(1), 41\u201349 (2008)","journal-title":"Global Journal of Applied Mathematics and Mathematical Sciences"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"R.M. Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W function. Advances in Computational Mathematics\u00a05(1), 329\u2013359 (1996), http:\/\/dx.doi.org\/10.1007\/BF02124750","journal-title":"Advances in Computational Mathematics"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. John Wiley & Sons (2006)","DOI":"10.1002\/047174882X"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Diaconis, P.: Group Representations in Probability and Statistics, vol.\u00a011. Institute of Mathematical Statistics (1988)","DOI":"10.1214\/lnms\/1215467407"},{"key":"40_CR7","unstructured":"Farnoud, F., Schwartz, M., Bruck, J.: Rate-distortion for ranking with incomplete information. arXiv preprint (2014), http:\/\/arxiv.org\/abs\/1401.3093"},{"key":"40_CR8","first-page":"58","volume-title":"Proc. ACM SIGMOD Int. Conf. Management of Data","author":"M. Greenwald","year":"2001","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 58\u201366. ACM, New York (2001), http:\/\/doi.acm.org\/10.1145\/375663.375670"},{"issue":"3","key":"40_CR9","doi-asserted-by":"publisher","first-page":"623","DOI":"10.2307\/3212956","volume":"17","author":"L. Holst","year":"1980","unstructured":"Holst, L.: On the lengths of the pieces of a stick broken at random. Journal of Applied Probability\u00a017(3), 623\u2013634 (1980)","journal-title":"Journal of Applied Probability"},{"key":"40_CR10","first-page":"426","volume-title":"Proc. ACM SIGMOD Int. Conf. Management of Data","author":"G.S. Manku","year":"1998","unstructured":"Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Approximate medians and other quantiles in one pass and with limited memory. In: Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 426\u2013435. ACM, New York (1998), http:\/\/doi.acm.org\/10.1145\/276304.276342"},{"key":"40_CR11","unstructured":"McGregor, A., Valiant, P.: The shifting sands algorithm. In: ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 453\u2013458. SIAM (2012), http:\/\/dl.acm.org\/citation.cfm?id=2095116.2095155"},{"issue":"3","key":"40_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J. Munro","year":"1980","unstructured":"Munro, J., Paterson, M.: Selection and sorting with limited storage. Theoretical Computer Science\u00a012(3), 315\u2013323 (1980), http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397580900614","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T04:20:11Z","timestamp":1716956411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}