{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:18:33Z","timestamp":1763619513579},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0022-0000(03)00014-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:57:28Z","timestamp":1056981448000},"page":"291-310","source":"Crossref","is-referenced-by-count":20,"title":["A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant"],"prefix":"10.1016","volume":"67","author":[{"given":"Mary","family":"Cryan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0022-0000(03)00014-X_BIB1","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","article-title":"A polynomial-time algorithm for counting integral points in polyhedra when the dimension is fixed","volume":"19","author":"Barvinok","year":"1994","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/S0022-0000(03)00014-X_BIB2","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\/S0022-0000(03)00014-X_BIB3","doi-asserted-by":"crossref","unstructured":"M. Cryan, M. Dyer, L. Goldberg, M. Jerrum, R. Martin, Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows, Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, Montreal, 2002, pp. 711\u2013720.","DOI":"10.1109\/SFCS.2002.1181996"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB4","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1214\/aos\/1176349634","article-title":"Testing for independence in a two-way table","volume":"13","author":"Diaconis","year":"1995","journal-title":"Ann. Statist."},{"key":"10.1016\/S0022-0000(03)00014-X_BIB5","series-title":"Discrete Probability and Algorithms","first-page":"15","article-title":"Rectangular arrays with fixed margins","volume":"Vol. 72","author":"Diaconis","year":"1995"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB6","unstructured":"P. Diaconis, L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, Technical Report, Department of Mathematics, Harvard University, 1995."},{"issue":"1","key":"10.1016\/S0022-0000(03)00014-X_BIB7","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\/S0022-0000(03)00014-X_BIB8","series-title":"Surveys in Combinatorics 1999","first-page":"101","article-title":"Random walks on combinatorial objects","volume":"Vol. 267","author":"Dyer","year":"1999"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(99)00136-X","article-title":"Polynomial-time counting and sampling of two-rowed contingency tables","volume":"246","author":"Dyer","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0022-0000(03)00014-X_BIB10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1287\/moor.22.3.545","article-title":"On Barvinok's algorithm for counting lattice points in fixed dimension","volume":"22","author":"Dyer","year":"1997","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/S0022-0000(03)00014-X_BIB11","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\/S0022-0000(03)00014-X_BIB12","unstructured":"G. Hadley, Linear Programming, Addison-Wesley, Massachusetts, 1962, pp. 273\u2013330."},{"issue":"1","key":"10.1016\/S0022-0000(03)00014-X_BIB13","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\u00d7n contingency tables","volume":"13","author":"Hernek","year":"1998","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB14","series-title":"Approximation Algorithms for NP-Hard Problems","first-page":"482","article-title":"Markov chain Monte Carlo method: an approach to approximate counting and integration","author":"Jerrum","year":"1997"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0022-0000(03)00014-X_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X","article-title":"Random walks and an O*(n5) volume algorithm for convex bodies","volume":"11","author":"Kannan","year":"1997","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB17","doi-asserted-by":"crossref","unstructured":"R. Karp, M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM Press, 1983, pp. 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB18","doi-asserted-by":"crossref","unstructured":"J.L. Kelley, T.P. Srinivasan, Measure and Integral, Vol. 1, Springer-Verlag Graduate Texts in Mathematics, Vol. 116, Springer, Berlin, 1988.","DOI":"10.1007\/978-1-4612-4570-4_1"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB19","doi-asserted-by":"crossref","unstructured":"B. Morris, Improved bounds for sampling contingency tables. Third International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science, Vol. 1671, Springer, Berlin, 1999, pp. 121\u2013129.","DOI":"10.1007\/978-3-540-48413-4_12"},{"key":"10.1016\/S0022-0000(03)00014-X_BIB20","unstructured":"J. Mount, Application of Convex Sampling to Optimization and Contingency Table Generation, Ph.D. Thesis, Technical Report CMU-CS-95-152, Computer Science Department, Carnegie Mellon University, 1995."},{"key":"10.1016\/S0022-0000(03)00014-X_BIB21","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":"1989","journal-title":"Inform. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300014X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300014X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T06:30:57Z","timestamp":1585031457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000300014X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S002200000300014X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00014-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}