{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T05:39:03Z","timestamp":1776404343160,"version":"3.51.2"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1958,9,1]],"date-time":"1958-09-01T00:00:00Z","timestamp":-357696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":20345,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1958,9]]},"DOI":"10.1016\/s0019-9958(58)80001-7","type":"journal-article","created":{"date-parts":[[2005,3,11]],"date-time":"2005-03-11T16:52:35Z","timestamp":1110559955000},"page":"181-197","source":"Crossref","is-referenced-by-count":36,"title":["Sorting, trees, and measures of order"],"prefix":"10.1016","volume":"1","author":[{"given":"W.H.","family":"Burge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(58)80001-7_bib1","first-page":"87","article-title":"Sorting of data on an electronic computer","volume":"103","author":"Davies","year":"1956"},{"key":"10.1016\/S0019-9958(58)80001-7_bib2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/320831.320833","article-title":"Sorting on electronic computer systems","volume":"3","author":"Friend","year":"1956","journal-title":"Assoc. Computing Machinery J."},{"key":"10.1016\/S0019-9958(58)80001-7_bib3","series-title":"Proc. Eastern Joint Computer Conf.","first-page":"39","article-title":"Evaluation of sorting methods","author":"Hosken","year":"1956"},{"key":"10.1016\/S0019-9958(58)80001-7_bib4","first-page":"1098","article-title":"A method for the construction of minimum redundancy, codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/S0019-9958(58)80001-7_bib5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/320881.320882","article-title":"Account identification for automatic data processing","volume":"4","author":"Oettinger","year":"1957","journal-title":"Assoc. Computing Machinery J."},{"key":"10.1016\/S0019-9958(58)80001-7_bib6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995858800017?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995858800017?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T05:24:53Z","timestamp":1548653093000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995858800017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1958,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1958,9]]}},"alternative-id":["S0019995858800017"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(58)80001-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1958,9]]}}}