{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T17:29:49Z","timestamp":1673198989132},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,22]],"date-time":"2015-01-22T00:00:00Z","timestamp":1421884800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11083-015-9347-y","type":"journal-article","created":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T12:02:53Z","timestamp":1422014573000},"page":"23-28","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Note on Average-Case Sorting"],"prefix":"10.1007","volume":"33","author":[{"given":"Shay","family":"Moran","sequence":"first","affiliation":[]},{"given":"Amir","family":"Yehudayoff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,22]]},"reference":[{"key":"9347_CR1","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. ISBN 978-0-471-24195-9, pp. 1\u2013748. Wiley (2006)"},{"key":"9347_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"ML Fredman","year":"1976","unstructured":"Fredman, M.L.: How good is the information theory bound in sorting Theor. Comput. Sci. 1, 355\u2013361 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9347_CR3","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell Syst. Tech. J 38(4), 933\u2013968 (1959)","journal-title":"Bell Syst. Tech. J"},{"issue":"3","key":"9347_CR4","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1006\/jcss.1995.1077","volume":"51","author":"J Kahn","year":"1995","unstructured":"Kahn, J., Kim, J.H.: Entropy and sorting. J. Comput. Syst. Sci. 51(3), 390\u2013399 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"9347_CR5","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, 113\u2013126 (1984)","journal-title":"Order"},{"key":"9347_CR6","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, Mass. (1973)"},{"key":"9347_CR7","unstructured":"Leighton, T., Moitra, A.: On Entropy and Extensions of Posets. Manuscript (2011)"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-015-9347-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-015-9347-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-015-9347-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:12:16Z","timestamp":1559351536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-015-9347-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,22]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9347"],"URL":"https:\/\/doi.org\/10.1007\/s11083-015-9347-y","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,22]]}}}