{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:24Z","timestamp":1725455484929},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016270","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"449-457","source":"Crossref","is-referenced-by-count":2,"title":["Optimal sorting of seven element sets"],"prefix":"10.1007","author":[{"given":"\u013dubor","family":"Koll\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","volume-title":"Questionnaire, codage et tris","author":"Y. C\u00e9sary","year":"1968","unstructured":"C\u00e9sary, Y.: Questionnaire, codage et tris. PhD Thesis, Institut Blaise Pascal, Centre National de la Recherche, Paris 1968"},{"issue":"5","key":"41_CR2","first-page":"387","volume":"66","author":"L.R. Ford","year":"1959","unstructured":"Ford, L.R., Johnson, S.B.: A tournament problem. AMM 66, 5(1959), pp. 387\u2013389","journal-title":"AMM"},{"key":"41_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00565647","volume":"1","author":"J. Kahn","year":"1984","unstructured":"Kahn, J., Saks, M.: Balancing poset extensions. Order 1(1984), pp. 113\u2013126","journal-title":"Order"},{"key":"41_CR4","volume-title":"The Art of Computer Programming, Vol. 3 Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 3 Sorting and Searching, Addison-Wesley, Reading, Mass., 1973"},{"key":"41_CR5","volume-title":"Th\u00e9orie des questionnaires","author":"C. Picard","year":"1965","unstructured":"Picard, C.: Th\u00e9orie des questionnaires. Gauthier-Villars, Paris 1965"},{"key":"41_CR6","first-page":"355","volume-title":"Orders: Description and Roles","author":"I. Rival","year":"1984","unstructured":"Rival, I.: Linear extensions of finite ordered sets, in Orders: Description and Roles, M. Pouzet, D. Richards eds., Elsevier, North-Holland, 1984, pp. 355\u2013370"},{"key":"41_CR7","unstructured":"Koll\u00e1r, \u013d.: Expected number of comparisons in the Hwang-Lin merging algorithm. Computers and Artificial Intelligence, No. 4, 1986"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016270.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:54Z","timestamp":1607549754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0016270","relation":{},"subject":[]}}