{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:33:53Z","timestamp":1725770033269},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319046563"},{"type":"electronic","value":"9783319046570"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04657-0_22","type":"book-chapter","created":{"date-parts":[[2014,1,17]],"date-time":"2014-01-17T05:19:32Z","timestamp":1389935972000},"page":"225-236","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Sorting k-Sets in Bins"],"prefix":"10.1007","author":[{"given":"Atsuki","family":"Nagao","sequence":"first","affiliation":[]},{"given":"Kazuhisa","family":"Seto","sequence":"additional","affiliation":[]},{"given":"Junichi","family":"Teruyama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"B\u00f3na, M., Flynn, R.: Sorting a Permutation with Block Moves. arXiv:0806.2787v1"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, C., R\u00f6sler, U.: Partial quicksort and quickpartitionsort. In: DMTCS Proceedings 2001, pp. 505\u2013512 (2010)","DOI":"10.46298\/dmtcs.2781"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1016\/j.disc.2007.01.011","volume":"307","author":"D. Cranston","year":"2007","unstructured":"Cranston, D., Sudborough, I.H., West, D.B.: Short Proofs for Cut-and-Paste Sorting of Permutations. Discrete Mathematics\u00a0307, 2866\u20132870 (2007)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1137\/070697720","volume":"40","author":"C. Daskalakis","year":"2011","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Eiesenfeld, S.J., Verbin, E.: Sorting and selection in posets. SIAM Journal on Computing\u00a040(3), 597\u2013622 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.2307\/2318261","volume":"82","author":"H. Dweighter","year":"1975","unstructured":"Dweighter, H.: Elementary Problems. American Mathematical Monthly\u00a082, 1010 (1975)","journal-title":"American Mathematical Monthly"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Elizalde, S., Winkler, P.: Sorting by Placement and Shift. In: Proc. ACM\/SIAM Symp. on Discrete Algorithms (SODA), pp. 68\u201375 (2009)","DOI":"10.1137\/1.9781611973068.8"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H. Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., W\u00e1stlund, J.: Sorting a bridge hand. Discrete Math.\u00a0241, 289\u2013300 (2001)","journal-title":"Discrete Math."},{"issue":"1","key":"22_CR8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0217007","volume":"17","author":"U. Faigle","year":"1988","unstructured":"Faigle, U., Tu\u0155an, G.: Sorting and Recognition Problems for Ordered Sets. SIAM Journal on Computing\u00a017(1), 100\u2013113 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W.H. Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discrete Math.\u00a027, 47\u201357 (1979)","journal-title":"Discrete Math."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"M.H. Heydari","year":"1997","unstructured":"Heydari, M.H., Sudborough, I.H.: On the diameter of pancake network. J. Algorithms\u00a025, 67\u201394 (1997)","journal-title":"J. Algorithms"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: PARTITION (Algorithm 63);QUICKSORT (Algorithm 64);FIND (Algorithm 65). Communication of the Association for Computing Machinery\u00a04, 321\u2013322 (1961)","journal-title":"Communication of the Association for Computing Machinery"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Ito, H., Teruyama, J., Yoshida, Y.: An almost optimal algorithm for winkler\u2019s sorting pairs in bins. Progress in Informatics\u00a0(9), 3\u20137 (2012)","DOI":"10.2201\/NiiPi.2012.9.2"},{"key":"22_CR13","unstructured":"P\u00fcttmann, A.: Krawattenproblem, http:\/\/www.springer.com\/cda\/content\/document\/cda_downloaddocument\/SAV_Krawattenraetsel_Loesung_Puettmann"},{"key":"22_CR14","first-page":"149","volume":"143","author":"P. Winkler","year":"2004","unstructured":"Winkler, P.: Mathematical Puzzles: A Connoisseur\u2019s Collection. A K Peters\u00a0143, 149\u2013151 (2004)","journal-title":"A K Peters"},{"key":"22_CR15","unstructured":"West, D.B.: (2008), http:\/\/www.math.uiuc.edu\/~west\/regs\/sortpair.html"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04657-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T20:09:33Z","timestamp":1648066173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04657-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319046563","9783319046570"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04657-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}