{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:59:13Z","timestamp":1778291953775,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(83)90023-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"263-276","source":"Crossref","is-referenced-by-count":58,"title":["Upper bounds for sorting integers on random access machines"],"prefix":"10.1016","volume":"28","author":[{"given":"David","family":"Kirkpatrick","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Reisch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90023-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"4","key":"10.1016\/0304-3975(83)90023-3_BIB2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90023-3_BIB3","series-title":"Tech. Rept. 74-221","article-title":"An O(n log log n) on-line algorithm for the insert-extract min problem","author":"van Emde Boas","year":"1974"},{"key":"10.1016\/0304-3975(83)90023-3_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"van Emde Boas","year":"1977","journal-title":"Math. System Theory"},{"issue":"4","key":"10.1016\/0304-3975(83)90023-3_BIB5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."},{"issue":"8\/9","key":"10.1016\/0304-3975(83)90023-3_BIB6","first-page":"890","article-title":"On lower bounds for time complexity of some algorithms","volume":"32","author":"Jiawei","year":"1900","journal-title":"Scientia Sinica"},{"key":"10.1016\/0304-3975(83)90023-3_BIB7","series-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1971"},{"key":"10.1016\/0304-3975(83)90023-3_BIB8","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(83)90023-3_BIB9","article-title":"Decision trees and random access machines","author":"Paul","year":"1980","journal-title":"Symp. \u00fcber Logic und Algorithmik"},{"key":"10.1016\/0304-3975(83)90023-3_BIB10","unstructured":"C. Backoff, Private communication, 1980."},{"key":"10.1016\/0304-3975(83)90023-3_BIB11","series-title":"Doctoral Thesis","article-title":"Komplexit\u00e4t von Sortierproblemen und Anwendungen der Kolmogoroff-komplexit\u00e4t","author":"Reisch","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:55:32Z","timestamp":1555077332000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900233"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90023-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}