{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:04:31Z","timestamp":1761674671705},"reference-count":34,"publisher":"Wiley","issue":"3-4","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<238::aid-rsa4>3.0.co;2-e","type":"journal-article","created":{"date-parts":[[2002,9,10]],"date-time":"2002-09-10T18:43:15Z","timestamp":1031683395000},"page":"238-259","source":"Crossref","is-referenced-by-count":15,"title":["Delayed path coupling and generating random permutations"],"prefix":"10.1002","volume":"17","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros?aw","family":"Kuty?owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB1","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BFb0068322","volume-title":"S\ufffdminaire de Probabilit\ufffds XVII, 1981\/82","volume":"986","author":"Aldous","year":"1983","unstructured":"? Random walks of finite groups and rapidly mixing Markov chains,? in S\ufffdminaire de Probabilit\ufffds XVII, 1981\/82, Volume 986 of Lecture Notes in Mathematics, and (Editors), Springer-Verlag, Berlin, 1983, pp. 243-297."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.2307\/2323590","volume":"93","author":"Aldous","year":"1986","journal-title":"Am Math Month"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB3","first-page":"95","volume-title":"Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Island of Crete, Greece, 2-6 July 1990","author":"Anderson","year":"1990","unstructured":"? Parallel algorithms for generating random permutations on a shared memory machine,? in Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Island of Crete, Greece, 2-6 July 1990. ACM Press, New York, NY, 1990, pp. 95-102."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB4","author":"Anderson","unstructured":"and Optical communication for pointer based algorithms, Tech. Rep. CRI 88-14, University of Southern California, 1988."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB5","first-page":"223","volume-title":"Proceedings of the 38th Symposium on Foundations of Computer Science, Miami Beach, FL, 19-22 October 1997","author":"Bubley","unstructured":"and ? Path coupling: A technique for proving rapid mixing in Markov chains,? in Proceedings of the 38th Symposium on Foundations of Computer Science, Miami Beach, FL, 19-22 October 1997. IEEE Computer Society Press, Los Alamitos, CA, pp. 223-231."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB6","first-page":"355","volume-title":"Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 25-27 January 1998","author":"Bubley","unstructured":"and ? Faster random generation of linear extensions,? in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 25-27 January 1998. SIAM, Philadelphia, PA, pp. 355-363."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB7","first-page":"355","volume-title":"Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 25-27 January 1998","author":"Bubley","unstructured":"and ? Beating the 2? bound for approximately counting colourings: A computer-assisted proof of rapid mixing,? in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 25-27 January 1998. SIAM, Philadelphia, PA, pp. 355-363."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB8","first-page":"202","volume-title":"Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, 28 June-2 July 1998","author":"Czumaj","unstructured":"? Recovery time of dynamic allocation processes,? in Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, 28 June-2 July 1998. ACM Press, New York, NY, pp.202-211."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/PL00009206","volume":"21","author":"Czumaj","year":"1998","journal-title":"Algorithmica"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB10","first-page":"271","volume-title":"Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 17-19 January 1999","author":"Czumaj","unstructured":"and ? Delayed path coupling and generating random permutations via distributed stochastic processes,? in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 17-19 January 1999, SIAM, Philadelphia, PA, pp. 271-280."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB11","series-title":"Lecture Notes","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0086177","volume-title":"Group Representations in Probability and Statistics","volume":"11","author":"Diaconis","year":"1988","unstructured":"Group Representations in Probability and Statistics, Volume 11 of Lecture Notes-Monograph Series. Institute of Mathematical Statistics, Hayward, CA, 1988."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01294457","volume":"15","author":"Diaconis","year":"1995","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00535487","volume":"57","author":"Diaconis","year":"1981","journal-title":"Zeitschrift Wahrscheinlichkeitstheorie verwandte Gebiete"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"Dyer","year":"1991","journal-title":"J ACM"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB15","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BFb0055065","volume-title":"Proceedings of the 25th Annual International Colloquium on Automata, Languages and Programming","volume":"1443","author":"Dyer","year":"1998","unstructured":"and ? A genuinely polynomial-time algorithm for sampling two-rowed contingency tables,? in Proceedings of the 25th Annual International Colloquium on Automata, Languages and Programming, Volume 1443 of Lecture Notes in Computer Science, and (Editors), Aalborg, Denmark, 13-17 July 1998. Springer-Verlag, Berlin, pp. 339-350."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<285::AID-RSA6>3.0.CO;2-R","volume":"13","author":"Dyer","year":"1998","journal-title":"Ran Struct Algorith"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB17","series-title":"London Mathem","first-page":"101","volume-title":"Surveys in Combinatorics","volume":"267","author":"Dyer","year":"1999","unstructured":"and ? Random walks on combinatorial objects,? in Surveys in Combinatorics, Volume 267 of London Mathematical Society Lecture Note Series, and (Editors), Cambridge University Press, 1999, pp. 101-136."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1006\/jcss.1996.0079","volume":"53","author":"Gibbons","year":"1996","journal-title":"J Comput Syst Sci"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB19","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/S009753979427491","volume":"28","author":"Gibbons","year":"1999","journal-title":"SIAM J Comput"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB20","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/S0097539793259483","volume":"26","author":"Goldberg","year":"1997","journal-title":"SIAM J Comput"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB21","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-54233-7_151","volume-title":"Proceedings of the 18th Annual International Colloquium on Automata, Languages and Programming","volume":"510","author":"Hagerup","year":"1991","unstructured":"? Fast parallel generation of random permutations,? in Proceedings of the 18th Annual International Colloquium on Automata, Languages and Programming, Volume 510 of Lecture Notes in Computer Science, and (Editors), Madrid, Spain, 8-12 July 1991, Springer-Verlag, Berlin, pp. 405-416."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB22","first-page":"482","volume-title":"Approximation Algorithms for ??-Hard Problems","author":"Jerrum","year":"1996","unstructured":"and ? The Markov chain Monte Carlo method: An approach to approximate counting and integration,? in Approximation Algorithms for ??-Hard Problems, Chapter 12, (Editor), PWS Publishing Company, Boston, MA, 1996, pp. 482-520."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB23","first-page":"656","volume-title":"Proceedings of the 35th Symposium on Foundations of Computer Science, Santa Fe, NM, 20-22 November 1994","author":"Kannan","unstructured":"? Markov chains and polynomial time algorithms,? in Proceedings of the 35th Symposium on Foundations of Computer Science, Santa Fe, NM, 20-22 November 1994, IEEE Computer Society Press, Los Alamitos, CA, pp. 656-671."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB24","volume-title":"Lectures on the Coupling Method","author":"Lindvall","year":"1992","unstructured":"Lectures on the Coupling Method, John Wiley & Sons, New York, NY, 1992."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB25","first-page":"307","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 6-8 May 1991","author":"Matias","unstructured":"and ? Converting high probability into nearly-constant time?with applications to parallel hashing,? in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 6-8 May 1991, ACM Press, New York, NY, pp. 307-316."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB26","first-page":"478","volume-title":"Proceedings of the 26th Symposium on Foundations of Computer Science, Portland, OR, 21-23 October 1985","author":"Miller","unstructured":"and ? Parallel tree contraction,? in Proceedings of the 26th Symposium on Foundations of Computer Science, Portland, OR, 21-23 October 1985, IEEE Computer Society Press, Los Alamitos, CA, pp. 478-489."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB27","first-page":"47","volume":"5","author":"Miller","year":"1989","journal-title":"Adv Comput Res"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"Motwani","year":"1995","unstructured":"and Randomized algorithms. Cambridge University Press, Cambridge, 1995."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB29","first-page":"672","volume-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 16-18 May 1993","author":"Rackoff","unstructured":"and ? Cryptographic defense against traffic analysis,? in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 16-18 May 1993, ACM Press, New York, NY, pp. 672-681."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB30","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"19","author":"Rajasekaran","year":"1989","journal-title":"SIAM J Comput"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB31","first-page":"496","volume-title":"Proceedings of the 26th Symposium on Foundations of Computer Science, Portland, OR, 21-23 October 1985","author":"Reif","unstructured":"? An optimal parallel algorithm for integer sorting,? in Proceedings of the 26th Symposium on Foundations of Computer Science, Portland, OR, 21-23 October 1985, IEEE Computer Society Press, Los Alamitos, CA, pp. 496-504."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting: A Markov Chain Approach","author":"Sinclair","year":"1993","unstructured":"Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkh\ufffduser, Boston, MA, 1993."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB33","volume-title":"Proceedings of the 40th Symposium on Foundations of Computer Science, New York City, NY, 17-19 October 1999","author":"Vigoda","unstructured":"? Improved bounds for sampling colorings,? in Proceedings of the 40th Symposium on Foundations of Computer Science, New York City, NY, 17-19 October 1999, IEEE Computer Society Press, Los Alamitos, CA."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E-BIB34","first-page":"429","volume-title":"Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 28-30 January 1996","author":"Zito","unstructured":"and ? ??? algorithms for the uniform generation of combinatorial structures,? in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 28-30 January 1996, SIAM, Philadelphia, PA, pp. 429-437."}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1098-2418(200010%2F12)17:3%2F4%3C238::AID-RSA4%3E3.0.CO;2-E","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1098-2418(200010\/12)17:3\/4%3C238::AID-RSA4%3E3.0.CO;2-E","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T03:21:39Z","timestamp":1625109699000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":34,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,10]]}},"URL":"https:\/\/doi.org\/10.1002\/1098-2418(200010\/12)17:3\/4<238::aid-rsa4>3.0.co;2-e","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}