{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:17:40Z","timestamp":1648901860994},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T00:00:00Z","timestamp":1273104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-010-9323-9","type":"journal-article","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T21:09:51Z","timestamp":1273093791000},"page":"457-468","source":"Crossref","is-referenced-by-count":2,"title":["On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries"],"prefix":"10.1007","volume":"22","author":[{"given":"Ivona","family":"Bez\u00e1kov\u00e1","sequence":"first","affiliation":[]},{"given":"Nayantara","family":"Bhatnagar","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Randall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,6]]},"reference":[{"key":"9323_CR1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1002\/rsa.20155","volume":"30","author":"I Bez\u00e1kov\u00e1","year":"2007","unstructured":"Bez\u00e1kov\u00e1 I, Bhatnagar N, Vigoda E (2007) Sampling binary contingency tables with a greedy start. Random Struct Algorithms 30:168\u2013205","journal-title":"Random Struct Algorithms"},{"key":"9323_CR2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0022-0000(03)00014-X","volume":"67","author":"M Cryan","year":"2003","unstructured":"Cryan M, Dyer M (2003) A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J Comput Syst Sci 67:291\u2013310","journal-title":"J Comput Syst Sci"},{"key":"9323_CR3","doi-asserted-by":"crossref","unstructured":"Cryan M, Dyer M, Goldberg L, Jerrum M, Martin R (2002) Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. In: Proc 43rd IEEE symposium on foundations of computer science, pp 711\u2013720","DOI":"10.1109\/SFCS.2002.1181996"},{"key":"9323_CR4","doi-asserted-by":"crossref","unstructured":"Cryan M, Dyer M, Randall D (2005) Approximately counting integral flows and cell-bounded contingency tables. In: Proc 37th ACM symposium on theory of computing, pp 413\u2013422","DOI":"10.1145\/1060590.1060652"},{"key":"9323_CR5","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1214\/aos\/1176349634","volume":"13","author":"P Diaconis","year":"1995","unstructured":"Diaconis P, Efron B (1995) Testing for independence in a two-way table: new interpretations of the chi-square statistic. Ann Stat 13:845\u2013913","journal-title":"Ann Stat"},{"key":"9323_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-1-4612-0801-3_3","volume-title":"Discrete probability and algorithms","author":"P Diaconis","year":"1995","unstructured":"Diaconis P, Gangolli A (1995) Rectangular arrays with fixed margins. In: Aldous D et al. (eds) Discrete probability and algorithms. Springer, Berlin, pp 15\u201341"},{"key":"9323_CR7","doi-asserted-by":"crossref","unstructured":"Dyer M (2003) Approximate counting by dynamic programming. In: Proc 35th ACM symposium on the theory of computing, pp 693\u2013699","DOI":"10.1145\/780542.780643"},{"key":"9323_CR8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q","volume":"10","author":"M Dyer","year":"1997","unstructured":"Dyer M, Kannan R, Mount J (1997) Sampling contingency tables. Random Struct Algorithms 10:487\u2013506","journal-title":"Random Struct Algorithms"},{"key":"9323_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"M Jerrum","year":"1989","unstructured":"Jerrum M, Sinclair A (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Inf Comput 82:93\u2013133","journal-title":"Inf Comput"},{"key":"9323_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum M, Valiant L, Vazirani V (1986) Random generation of combinatorial structures from a uniform distribution. Theor Comput Sci 43:169\u2013188","journal-title":"Theor Comput Sci"},{"key":"9323_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","volume":"14","author":"R Kannan","year":"1999","unstructured":"Kannan R, Tetali P, Vempala S (1999) Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct Algorithms 14:293\u2013308","journal-title":"Random Struct Algorithms"},{"key":"9323_CR12","first-page":"557","volume":"309","author":"G Lawler","year":"1988","unstructured":"Lawler G, Sokal A (1988) Bounds on the L2 spectrum for Markov chains and Markov processes: a generalization of Cheeger\u2019s inequality. Trans Am Math Soc 309:557\u2013580","journal-title":"Trans Am Math Soc"},{"key":"9323_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/rsa.10049","volume":"21","author":"B Morris","year":"2002","unstructured":"Morris B (2002) Improved bounds for sampling contingency tables. Random Struct Algorithms 21:135\u2013146","journal-title":"Random Struct Algorithms"},{"key":"9323_CR14","unstructured":"Mount J (1995) Application of convex sampling to optimization and contingency table generation. PhD thesis, Carnegie Mellon University. (Technical report CMU-CS-95-152, Department of Computer Science)"},{"key":"9323_CR15","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9323-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9323-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9323-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9323-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9323"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9323-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,6]]}}}