{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:54:37Z","timestamp":1778025277234,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":5221,"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":[[1999,4]]},"DOI":"10.1016\/s0012-365x(98)00311-2","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"25-52","source":"Crossref","is-referenced-by-count":20,"title":["Balanced pairs in partial orders"],"prefix":"10.1016","volume":"201","author":[{"given":"Graham","family":"Brightwell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00311-2_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00333131","article-title":"A note on merging","volume":"2","author":"Aigner","year":"1985","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(87)90151-7","article-title":"Computing the number of mergings with constraints","volume":"24","author":"Atkinson","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(88)90087-8","article-title":"Linear extensions of infinite posets","volume":"70","author":"Brightwell","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF00353656","article-title":"Semiorders and the 13\u201323 conjecture","volume":"5","author":"Brightwell","year":"1989","journal-title":"it Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0012-365X(94)90147-3","article-title":"Linear extensions of random orders","volume":"125","author":"Brightwell","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01110378","article-title":"Balancing pairs and the cross-product conjecture","volume":"12","author":"Brightwell","year":"1995","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00383444","article-title":"Counting linear extensions","volume":"8","author":"Brightwell","year":"1991","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB8","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0405037","article-title":"The 13\u201323 conjecture for 5-thin poests","volume":"5","author":"Brightwell","year":"1992","journal-title":"SIAM J. Discrete. Math."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(98)00333-1","article-title":"Faster random generation of linear extensions","volume":"201","author":"Bubley","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB10","series-title":"Probabilistic Combinatorics and its Applications","first-page":"123","article-title":"Computing the volume of convex bodies: a case where randomness provably helps","volume":"vol. 44","author":"Dyer","year":"1991"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","article-title":"A random polynomial-time algorithm for approximating the volume of convex bodies","volume":"38","author":"Dyer","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB12","series-title":"Combinatorics","first-page":"145","article-title":"Balancing pairs in partially ordered sets","volume":"vol. 1","author":"Felsner","year":"1993"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0095-8956(86)90027-4","article-title":"Proportional transitivity in linear extensions of ordered sets","volume":"41","author":"Fishbum","year":"1986","journal-title":"J. Combin. Theory. Ser. B"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","article-title":"How good is the information theoretic bound in sorting?","volume":"1","author":"Fredman","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0222007","article-title":"A note on poset geometries","volume":"22","author":"Friedman","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB16","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.2140\/pjm.1960.10.1257","article-title":"Partitions of mass-distributions and of convex bodies by hyperplanes","volume":"10","author":"Gr\u00fcnbaum","year":"1960","journal-title":"Pacific. J. Math."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1006\/jcss.1995.1077","article-title":"Entropy and sorting","volume":"51","author":"Kahn","year":"1995","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF01275670","article-title":"Balancing extensions via Brunn-Minkowski","volume":"11","author":"Kahn","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00565647","article-title":"Balancing poset extensions","volume":"1","author":"Kahn","year":"1984","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB20","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00385809","article-title":"On the conductance of order Markov chains","volume":"8","author":"Karzanov","year":"1991","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB21","series-title":"Computers and Decision Problems","first-page":"161","article-title":"Optimal algorithms in convex programming decomposition and sorting","author":"Khachiyan","year":"1989"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB22","first-page":"511","article-title":"Finite partially ordered sets and their associated sets of permutation","volume":"4","author":"Kislitsyn","year":"1968","journal-title":"Matematicheskiye Zametki"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00383760","article-title":"A strange pigeon-hole principle","volume":"7","author":"Koml\u00f3s","year":"1990","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB24","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1137\/0213049","article-title":"The information theoretic bound is good for merging","volume":"13","author":"Linial","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01098719","article-title":"Two inequalities for volumes of convex bodies","volume":"5","author":"Mityagin","year":"1968","journal-title":"Math. Notes"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF00333138","article-title":"Balancing linear extensions of ordered sets","volume":"2","author":"Saks","year":"1985","journal-title":"Order"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB27","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187680","article-title":"Two poset polytopes","volume":"1","author":"Stanley","year":"1986","journal-title":"Discrete Combin. Geom."},{"key":"10.1016\/S0012-365X(98)00311-2_BIB28","series-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"Trotter","year":"1991"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB29","first-page":"433","article-title":"Partially ordered sets","author":"Trotter","year":"1995"},{"key":"10.1016\/S0012-365X(98)00311-2_BIB30","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF00419038","article-title":"Balance theorems for height-2 posets","volume":"9","author":"Trotter","year":"1992","journal-title":"Order"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T04:16:20Z","timestamp":1681186580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0012365X98003112"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00311-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}