{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T10:14:33Z","timestamp":1773310473243,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(99)00136-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:13:43Z","timestamp":1027606423000},"page":"265-278","source":"Crossref","is-referenced-by-count":26,"title":["Polynomial-time counting and sampling of two-rowed contingency tables"],"prefix":"10.1016","volume":"246","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Greenhill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(99)00136-X_BIB1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1111\/j.2517-6161.1983.tb01231.x","article-title":"Estimation in contingency tables using prior information","volume":"45","author":"Albert","year":"1983","journal-title":"J. Roy. Statist. Soc. Ser. B (Methodological)"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB2","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\/S0304-3975(99)00136-X_BIB3","series-title":"Statistics","author":"Barlow","year":"1989"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB4","doi-asserted-by":"crossref","unstructured":"R. Bubley, M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, 38th Annual Symp. on Foundations of Computer Science, IEEE, San Alimitos, 1997, pp. 223\u2013231.","DOI":"10.1109\/SFCS.1997.646111"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB5","unstructured":"R. Bubley, M. Dyer, C. Greenhill, Beating the 2\u0394 bound for approximately counting colourings: A computer-assisted proof of rapid mixing, in 9th Annual Symp. on Discrete Algorithms, ACM-SIAM, New York-Philadelphia, 1998, pp. 355\u2013363."},{"key":"10.1016\/S0304-3975(99)00136-X_BIB6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<55::AID-RSA4>3.0.CO;2-A","article-title":"On sampling with Markov chains","volume":"9","author":"Chung","year":"1996","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB7","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1214\/aos\/1176349634","article-title":"Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion)","volume":"13","author":"Diaconis","year":"1985","journal-title":"Ann. Statist."},{"key":"10.1016\/S0304-3975(99)00136-X_BIB8","first-page":"15","article-title":"Rectangular arrays with fixed margins","volume":"Vol. 72","author":"Diaconis","year":"1995"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB9","unstructured":"P. Diaconis, L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, Tech. Report, Department of Mathematics, Harvard University, 1995."},{"key":"10.1016\/S0304-3975(99)00136-X_BIB10","doi-asserted-by":"crossref","unstructured":"M. Dyer, A. Frieze, Computing the volume of convex bodies: A case where randomness provably helps, Proc. Symp. in Applied Mathematics, Vol. 44, 1991, pp. 123\u2013169.","DOI":"10.1090\/psapm\/044\/1141926"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB11","doi-asserted-by":"crossref","unstructured":"M. Dyer, C. Greenhill, A genuinely polynomial time algorithm for sampling two-rowed contingency tables, 25th Internat. Colloq. on Automata, Languages and Programming, Aalborg, Denmark, 1998, pp. 339\u2013350.","DOI":"10.1007\/BFb0055065"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB12","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","article-title":"A more rapidly mixing Markov chain for graph colourings","volume":"13","author":"Dyer","year":"1998","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB13","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q","article-title":"Sampling contingency tables","volume":"10","author":"Dyer","year":"1997","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB14","doi-asserted-by":"crossref","unstructured":"D. Hernek, Private Communication, 1998.","DOI":"10.1002\/(SICI)1098-2418(199808)13:1<71::AID-RSA4>3.0.CO;2-P"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/(SICI)1098-2418(199808)13:1<71::AID-RSA4>3.0.CO;2-P","article-title":"Random generation of 2\u00d7 n contingency tables","volume":"13","author":"Hernek","year":"1998","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB16","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"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB17","unstructured":"R. Kannan, P. Tetali, S. Vempala, Simple Markov chain algorithms for generating bipartite graphs and tournaments, 8th Annual Symp. on Discrete Algorithms, ACM-SIAM, New York-Philadelphia, 1997, pp. 193\u2013200."},{"key":"10.1016\/S0304-3975(99)00136-X_BIB18","doi-asserted-by":"crossref","unstructured":"R.M. Karp, M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, 24th Annual Symp. on Foundations of Computer Science, IEEE, San Alimitos, 1983, pp. 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"10.1016\/S0304-3975(99)00136-X_BIB19","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"issue":"374","key":"10.1016\/S0304-3975(99)00136-X_BIB20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/01621459.1981.10477633","article-title":"The analysis of categorical data from complex sample surveys: chi-squared tests for goodness of fit and independence in two-way tables","volume":"76","author":"Rao","year":"1981","journal-title":"J. Amer. Statist. Assoc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900136X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900136X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T01:51:44Z","timestamp":1733277104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900136X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S030439759900136X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00136-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}