{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:37:47Z","timestamp":1725457067740},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540579354"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032405","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:30:32Z","timestamp":1134282632000},"page":"260-269","source":"Crossref","is-referenced-by-count":0,"title":["Thirty four comparisons are required to sort 13 items"],"prefix":"10.1007","author":[{"given":"Takumi","family":"Kasai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shusaku","family":"Sawato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeki","family":"Iwata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Aho, A. V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Algorithms. Addison-Wesley, (1974)"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/00029890.1959.11989306","volume":"66","author":"L.R. Ford","year":"1959","unstructured":"Ford, L.R., Johnson, S.M.: A tournament problem. Amer. Math. Monthly 66, (1959) 387\u2013389","journal-title":"Amer. Math. Monthly"},{"key":"15_CR3","unstructured":"Knuth, D.E.: The Art of Computer Programming Vol.3: Sorting and Searching. Addison-Wesley, (1973)"},{"key":"15_CR4","unstructured":"Manacher, G.K.: The Ford-Johnson sorting algorithm is not optimal. Proc. of the 15th Allerton Conf. on Communication, Control, and Computing, (1977) 390\u2013397"},{"key":"15_CR5","first-page":"497","volume":"65","author":"M.B. Wells","year":"1965","unstructured":"Wells, M.B.: Applications of a language for computing in combinatorics. Proc. IFIP Congress 65, (1965) 497\u2013498","journal-title":"Proc. IFIP Congress"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Wells, M.B.: Elements of Combinatorial Computing. Pergamon Press, (1971)","DOI":"10.1016\/B978-0-08-016091-7.50005-3"}],"container-title":["Lecture Notes in Computer Science","Logic, Language and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:47:15Z","timestamp":1586612835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540579354"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0032405","relation":{},"subject":[]}}