{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:58Z","timestamp":1759063558987},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90197-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:00Z","timestamp":1027655100000},"page":"1-15","source":"Crossref","is-referenced-by-count":17,"title":["Producing posets"],"prefix":"10.1016","volume":"35","author":[{"given":"Martin","family":"Aigner","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90197-7_BIB1","article-title":"Combinatorial Theory","volume":"234","author":"Aigner","year":"1979"},{"key":"10.1016\/0012-365X(81)90197-7_BIB2","unstructured":"M. Aigner, Selecting the top three elements, to appear."},{"key":"10.1016\/0012-365X(81)90197-7_BIB3","unstructured":"M. Aigner, Parallel complexity of sorting problems, to appear."},{"key":"10.1016\/0012-365X(81)90197-7_BIB4","article-title":"Lattice Theory","volume":"Vol. 25","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0012-365X(81)90197-7_BIB5","series-title":"Coll. Math. Soc.","article-title":"Selecting the tth largest using binary errorless comparisons","author":"Hadian","year":"1969"},{"key":"10.1016\/0012-365X(81)90197-7_BIB6","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\/0012-365X(81)90197-7_BIB7","series-title":"Comp. Sci. Dept. Techn. Rep. TR 74","article-title":"Topics in the complexity of combinatorial algorithms","author":"Kirkpatrick","year":"1974"},{"key":"10.1016\/0012-365X(81)90197-7_BIB8","first-page":"557","article-title":"On the selection of the kth element of an ordered set by pairwise comparisons","volume":"5","author":"Kislitsyn","year":"1964","journal-title":"Sibirsk Math. Zk."},{"key":"10.1016\/0012-365X(81)90197-7_BIB9","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0012-365X(81)90197-7_BIB10_1","first-page":"38","article-title":"The production of partial orders","author":"Sch\u00f6nhage","year":"1976","journal-title":"Ast\u00e9risque"},{"key":"10.1016\/0012-365X(81)90197-7_BIB10_2","first-page":"229","article-title":"The production of partial orders","author":"Sch\u00f6nhage","year":"1976","journal-title":"Ast\u00e9risque"},{"key":"10.1016\/0012-365X(81)90197-7_BIB11","first-page":"184","article-title":"Finding the median","volume":"13","author":"Sch\u00f6nhage","year":"1976","journal-title":"JCSS"},{"key":"10.1016\/0012-365X(81)90197-7_BIB12","series-title":"Techn. Rep. No. 114","article-title":"On an optimal search for the t best using binary errorless comparisons: The selection problem","author":"Sobel","year":"1968"},{"key":"10.1016\/0012-365X(81)90197-7_BIB13","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/360336.360339","article-title":"New upper bounds for selection","volume":"19","author":"Yap","year":"1976","journal-title":"Comm. ACM."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81901977?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81901977?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:29Z","timestamp":1555134689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81901977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81901977"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90197-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}