{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T03:26:57Z","timestamp":1787714817191,"version":"build-2784847793"},"reference-count":18,"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)00333-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"81-88","source":"Crossref","is-referenced-by-count":89,"title":["Faster random generation of linear extensions"],"prefix":"10.1016","volume":"201","author":[{"given":"Russ","family":"Bubley","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00333-1_BIB1","series-title":"S\u00e9minaire de Probabilit\u00e9s XVII 1981\/1982","first-page":"243","article-title":"Random walks on finite groups and rapidly mixing Markov chains","volume":"vol. 986","author":"Aldous","year":"1983"},{"key":"10.1016\/S0012-365X(98)00333-1_BIB2","series-title":"Monograph","article-title":"Reversible Markov chains and random walks on graphs","author":"Aldous","year":"1994"},{"issue":"3","key":"10.1016\/S0012-365X(98)00333-1_BIB3","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)00333-1_BIB4","series-title":"Proc. 38th Ann. Symp. on Foundations of Computer Science","first-page":"223","article-title":"Path coupling: a technique for proving rapid mixing in Markov chains","author":"Bubley","year":"1997"},{"issue":"2","key":"10.1016\/S0012-365X(98)00333-1_BIB5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00535487","article-title":"Generating a random permutation with random transpositions","volume":"57","author":"Diaconis","year":"1981","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"2","key":"10.1016\/S0012-365X(98)00333-1_BIB6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","article-title":"Spearman's footrule as a measure of disarray","volume":"39","author":"Diaconis","year":"1977","journal-title":"J. Roy. Statist. Soc., Ser. B (Methodological)"},{"issue":"1","key":"10.1016\/S0012-365X(98)00333-1_BIB7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1111\/j.1467-9876.1982.tb01678.x","article-title":"Definition of Spearman's footrule","volume":"31","author":"Dinneen","year":"1982","journal-title":"J. Roy. Statist. Soc., Ser. C (Appl. Statist.)"},{"key":"10.1016\/S0012-365X(98)00333-1_BIB8","series-title":"Proc. 44th Symp. Appl. Math.","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1090\/psapm\/044\/1141926","article-title":"Computing the volume of convex bodies: a case where randomness provably helps","author":"Dyer","year":"1991"},{"issue":"1","key":"10.1016\/S0012-365X(98)00333-1_BIB9","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)00333-1_BIB10","unstructured":"M. Dyer, C. Greenhill, On Markov chains for independent sets, preprint."},{"key":"10.1016\/S0012-365X(98)00333-1_BIB11","series-title":"Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"239","article-title":"Markov chains for linear extensions, the two-dimensional case","author":"Felsner","year":"1997"},{"key":"10.1016\/S0012-365X(98)00333-1_BIB12","series-title":"Approximation Algorithms for NP-Hard Problems","first-page":"482","article-title":"The Markov chain Monte Carlo method: an approach to approximate counting and integration","author":"Jerrum","year":"1996"},{"issue":"1","key":"10.1016\/S0012-365X(98)00333-1_BIB13","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"},{"issue":"3","key":"10.1016\/S0012-365X(98)00333-1_BIB14","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1214\/aop\/1176990349","article-title":"Generating a random linear extension of a partial order","volume":"19","author":"Matthews","year":"1991","journal-title":"Ann. Probab."},{"issue":"1\u20132","key":"10.1016\/S0012-365X(98)00333-1_BIB15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O","article-title":"Exact sampling with coupled Markov chains and applications to statistical mechanics","volume":"9","author":"Propp","year":"1996","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"10.1016\/S0012-365X(98)00333-1_BIB16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","article-title":"Generating linear extensions fast","volume":"23","author":"Pruesse","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(98)00333-1_BIB17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","article-title":"Approximate counting, uniform generation and rapidly mixing Markov chains","volume":"82","author":"Sinclair","year":"1999","journal-title":"Inform. Comput."},{"key":"10.1016\/S0012-365X(98)00333-1_BIB18","first-page":"89","article-title":"\u2018Footrule\u2019 for measuring correlations","volume":"2","author":"Spearman","year":"1906","journal-title":"Brit. J. Psychol."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T04:55:06Z","timestamp":1733288106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0012365X98003331"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00333-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}