{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T18:59:52Z","timestamp":1685559592538},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,11,1]],"date-time":"1980-11-01T00:00:00Z","timestamp":341884800000},"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":11946,"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":[[1980,11]]},"DOI":"10.1016\/0304-3975(80)90057-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"255-263","source":"Crossref","is-referenced-by-count":17,"title":["Determining the mode"],"prefix":"10.1016","volume":"12","author":[{"given":"David","family":"Dobkin","sequence":"first","affiliation":[]},{"given":"J.Ian","family":"Munro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90057-2_BIB1","unstructured":"B. Allen, On binary search trees, Research Report CS-77-27, Department of Compute Science, University of Waterloo."},{"key":"10.1016\/0304-3975(80)90057-2_BIB2","article-title":"Improved bounds on the costs of optimal and balanced binary search trees","volume":"69","author":"Bayer","year":"1975"},{"key":"10.1016\/0304-3975(80)90057-2_BIB3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90057-2_BIB4","series-title":"Proc. ICALP 5","first-page":"192","article-title":"Time and space bounds for selection problems","volume":"62","author":"Dobkin","year":"1978"},{"issue":"1","key":"10.1016\/0304-3975(80)90057-2_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0201004","article-title":"A simple algorithm for merging two disjoint linearly ordered sets","volume":"1","author":"Hwang","year":"1972","journal-title":"SICOMP"},{"key":"10.1016\/0304-3975(80)90057-2_BIB6","series-title":"Sorting and Searching","author":"Knuth","year":"1973"},{"issue":"1","key":"10.1016\/0304-3975(80)90057-2_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0205001","article-title":"Storing and searching in multisets","volume":"5","author":"Munro","year":"1976","journal-title":"SICOMP"},{"key":"10.1016\/0304-3975(80)90057-2_BIB8","first-page":"70","article-title":"On lower bounds for computing the ith largest element","author":"Pratt","year":"1973","journal-title":"Proc. 14th IEEE Symposium on S.W.A.T."},{"key":"10.1016\/0304-3975(80)90057-2_BIB9_1","series-title":"Combinatorial Algorithms","first-page":"173","article-title":"Bounds on the expected time for median computations","author":"Rivest","year":"1973"},{"key":"10.1016\/0304-3975(80)90057-2_BIB9_2","first-page":"173","article-title":"Algorithm 489 (Select)","volume":"18","author":"Rivest","year":"1975","journal-title":"Comm ACM"},{"key":"10.1016\/0304-3975(80)90057-2_BIB10","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the median","volume":"13","author":"Sch\u00f6nhage","year":"1976","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:25:16Z","timestamp":1555125916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,11]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,11]]}},"alternative-id":["0304397580900572"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90057-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,11]]}}}