{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T11:43:21Z","timestamp":1704195801911},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,8,1]],"date-time":"1982-08-01T00:00:00Z","timestamp":397008000000},"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":11308,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1982,8]]},"DOI":"10.1016\/0166-218x(82)90048-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"247-267","source":"Crossref","is-referenced-by-count":11,"title":["Selecting the top three elements"],"prefix":"10.1016","volume":"4","author":[{"given":"Martin","family":"Aigner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(82)90048-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(81)90197-7","article-title":"Producing posets","volume":"35","author":"Aigner","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(82)90048-8_BIB2","first-page":"585","article-title":"Selecting the t-th largest using binary errorless comparisons","author":"Hadian","year":"1969","journal-title":"Coll. Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/0166-218X(82)90048-8_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0205010","article-title":"Bounds for selection","volume":"5","author":"Hyafil","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(82)90048-8_BIB4","first-page":"557","article-title":"On the selection of the k-th element of an ordered set by pairwise comparisons","volume":"5","author":"Kislitsyn","year":"1964","journal-title":"Sibirsk Math. Zk."},{"key":"10.1016\/0166-218X(82)90048-8_BIB5","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0166-218X(82)90048-8_BIB6","series-title":"Technical Report No. 114","article-title":"On an optimal search for the t best using binary errorless comparisons: The selection problem","author":"Sobel","year":"1968"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X82900488?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X82900488?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:44Z","timestamp":1555136744000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X82900488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0166218X82900488"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(82)90048-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}