{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T00:23:15Z","timestamp":1783470195775,"version":"3.55.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0020-0190(83)90075-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"81-84","source":"Crossref","is-referenced-by-count":222,"title":["Log-logarithmic worst-case range queries are possible in space \u0398(N)"],"prefix":"10.1016","volume":"17","author":[{"given":"Dan E.","family":"Willard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90075-3_BIB1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/SFCS.1982.39","article-title":"Storing a space table with O(1) worst-case access times","author":"Fredman","year":"1982","journal-title":"Proc. 23rd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(83)90075-3_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00288534","article-title":"An algorithmic and complexity analysis of interpolation search","volume":"13","author":"Gonnet","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(83)90075-3_BIB3","series-title":"Rept. No. CS 81-13","article-title":"A priority queue in which initialization and queue operations take O(log log D) time","author":"Johnson","year":"1981"},{"key":"10.1016\/0020-0190(83)90075-3_BIB4","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(83)90075-3_BIB5","series-title":"Widely disseminated classroom notes on stratified trees","author":"Knuth","year":"1979"},{"key":"10.1016\/0020-0190(83)90075-3_BIB6","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","article-title":"Interpolation search\u2014Alog log N search","volume":"21","author":"Pearl","year":"1978","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0020-0190(83)90075-3_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(77)90072-2","article-title":"Understanding the complexity of interpolation search","volume":"6","author":"Pearl","year":"1977","journal-title":"Inform. Process. Letters"},{"key":"10.1016\/0020-0190(83)90075-3_BIB8","first-page":"75","article-title":"Preserving order in a forest in less than logarithmic time","author":"Van Emde Boas","year":"1975","journal-title":"Proc. 16th Ann. Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0020-0190(83)90075-3_BIB9","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."},{"key":"10.1016\/0020-0190(83)90075-3_BIB10","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. Systems Theory"},{"key":"10.1016\/0020-0190(83)90075-3_BIB11","first-page":"355","article-title":"Two very fast trie data structures","author":"Willard","year":"1981","journal-title":"19th Ann. Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(83)90075-3_BIB12","unstructured":"D.E. Willard, New trie data structures which support very fast search operations of order log M, JCSS, to appear."},{"key":"10.1016\/0020-0190(83)90075-3_BIB13","unstructured":"D.E. Willard, Searching nonuniformly generated files in log log N runtime, SIAM J. Comput., to appear."},{"key":"10.1016\/0020-0190(83)90075-3_BIB14","first-page":"3","article-title":"A log log N search algorithm for nonuniform distribution","volume":"Vol. II","author":"Willard","year":"1981"},{"key":"10.1016\/0020-0190(83)90075-3_BIB15","first-page":"462","article-title":"A new time complexity for orthogonal range queries","author":"Willard","year":"1982","journal-title":"20th Allerton Conf. on Communications, Control, and Computing"},{"key":"10.1016\/0020-0190(83)90075-3_BIB16","first-page":"173","article-title":"The complexity of searching an ordered random table","author":"Yao","year":"1975","journal-title":"Proc. 17th Ann. Symp. on the Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T08:42:42Z","timestamp":1580892162000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0020019083900753"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90075-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}