{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:46:05Z","timestamp":1725839165047},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_59","type":"book-chapter","created":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T23:00:57Z","timestamp":1448492457000},"page":"703-714","source":"Crossref","is-referenced-by-count":2,"title":["Run Generation Revisited: What Goes Up May or May Not Come Down"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"McCauley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"McGregor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shikha","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoa T.","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"9","key":"59_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"59_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., McCauley, S., McGregor, A., Singh, S., Vu, H.T.: Run generation revisited: What goes up may or may not come down. arXiv preprint \n                      arXiv:1504.06501\n                      \n                     (2015)","DOI":"10.1007\/978-3-662-48971-0_59"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Chandramouli, B., Goldstein, J.: Patience is a virtue: revisiting merge and sort on modern processors. In: Proceedings International Conference on Management of Data, pp. 731\u2013742 (2014)","DOI":"10.1145\/2588555.2593662"},{"issue":"4","key":"59_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Comput. Surv. 24(4), 441\u2013476 (1992)","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"59_CR5","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/355604.361597","volume":"15","author":"W Frazer","year":"1972","unstructured":"Frazer, W., Wong, C.: Sorting by natural selection. Commun. ACM 15(10), 910\u2013913 (1972)","journal-title":"Commun. ACM"},{"issue":"3","key":"59_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/320831.320833","volume":"3","author":"EH Friend","year":"1956","unstructured":"Friend, E.H.: Sorting on electronic computer systems. J. ACM 3(3), 134\u2013168 (1956)","journal-title":"J. ACM"},{"issue":"2","key":"59_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/363067.363102","volume":"10","author":"BJ Gassner","year":"1967","unstructured":"Gassner, B.J.: Sorting by replacement selecting. Commun. ACM 10(2), 89\u201393 (1967)","journal-title":"Commun. ACM"},{"issue":"5","key":"59_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/366552.366556","volume":"6","author":"MA Goetz","year":"1963","unstructured":"Goetz, M.A.: Internal and tape sorting using the replacement-selection technique. Commun. ACM 6(5), 201\u2013206 (1963)","journal-title":"Commun. ACM"},{"issue":"3","key":"59_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1132960.1132964","volume":"38","author":"G Graefe","year":"2006","unstructured":"Graefe, G.: Implementing sorting in database systems. ACM Comput. Surv. 38(3), 10 (2006)","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"59_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/368310.368397","volume":"6","author":"DE Knuth","year":"1963","unstructured":"Knuth, D.E.: Length of strings for a merge sort. Commun. ACM 6(11), 685\u2013688 (1963)","journal-title":"Commun. ACM"},{"key":"59_CR11","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching. Adison-Wesley, Reading (1998)"},{"issue":"2","key":"59_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1006\/jpdc.1993.1099","volume":"19","author":"YC Lin","year":"1993","unstructured":"Lin, Y.C.: Perfectly overlapped generation of long runs for sorting large files. J. Parallel Distrib. Comput. 19(2), 136\u2013142 (1993)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"9","key":"59_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0141-9331(96)01126-X","volume":"20","author":"YC Lin","year":"1997","unstructured":"Lin, Y.C., Lai, H.Y.: Perfectly overlapped generation of long runs on a transputer array for sorting. Microprocess. Microsyst. 20(9), 529\u2013539 (1997)","journal-title":"Microprocess. Microsyst."},{"issue":"4","key":"59_CR14","first-page":"375","volume":"5","author":"CL Mallows","year":"1963","unstructured":"Mallows, C.L.: Patience sorting. Bulletin Inst. Math. Appl. 5(4), 375\u2013376 (1963)","journal-title":"Bulletin Inst. Math. Appl."},{"key":"59_CR15","doi-asserted-by":"publisher","first-page":"871","DOI":"10.14778\/1920841.1920952","volume":"3","author":"X Martinez-Palau","year":"2010","unstructured":"Martinez-Palau, X., Dominguez-Sal, D., Larriba-Pey, J.L.: Two-way replacement selection. Proc. VLDB Endow. 3, 871\u2013881 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"59_CR16","unstructured":"Wikipedia: Timsort (2004). \n                      http:\/\/en.wikipedia.org\/wiki\/Timsort"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T13:59:24Z","timestamp":1559311164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}