{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:27Z","timestamp":1725535107495},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_31","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"307-316","source":"Crossref","is-referenced-by-count":0,"title":["On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries"],"prefix":"10.1007","author":[{"given":"Ivona","family":"Bez\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nayantara","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Randall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Bez\u00e1kov\u00e1, I., Bhatnagar, N., Vigoda, E.: Sampling binary contingency tables with a greedy start. Random Structures and Algorithms\u00a030, 168\u2013205 (2007)","DOI":"10.1002\/rsa.20155"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Cryan, M., Dyer, M.: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. Journal of Computer and System Sciences\u00a067, 291\u2013310 (2003)","DOI":"10.1016\/S0022-0000(03)00014-X"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Cryan, M., Dyer, M., Goldberg, L., Jerrum, M., Martin, R.: 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 (2002)","DOI":"10.1109\/SFCS.2002.1181996"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Cryan, M., Dyer, M., Randall, D.: Approximately counting integral flows and cell-bounded contingency tables. In: Proc. 37th ACM Symposium on Theory of Computing, pp. 413\u2013422 (2005)","DOI":"10.1145\/1060590.1060652"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Efron, B.: Testing for independence in a two-way table: new interpretations of the chi-square statistic. Annals of Statistics\u00a013, 845\u2013913 (1995)","DOI":"10.1214\/aos\/1176349645"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Gangolli, A.: Rectangular Arrays with Fixed Margins. In: Aldous, D., et al. (eds.) Discrete Probability and Algorithms, pp. 15\u201341. Springer, Heidelberg (1995)","DOI":"10.1007\/978-1-4612-0801-3_3"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Dyer, M.: Approximate counting by dynamic programming. In: Proc. 35th ACM Symposium on the Theory of Computing, pp. 693\u2013699 (2003)","DOI":"10.1145\/780542.780643"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Dyer, M., Kannan, R., Mount, J.: Sampling contingency tables. Random Structures\u00a0& Algorithms\u00a010, 487\u2013506 (1997)","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A.: Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation\u00a082, 93\u2013133 (1989)","DOI":"10.1016\/0890-5401(89)90067-9"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Jour. ACM\u00a051, 671\u2013697 (2004)","DOI":"10.1145\/1008731.1008738"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Valiant, L., Vazirani, V.: Random generation of combinatorial structures from a uniform distribution. Theoretical Comp. Sci.\u00a043, 169\u2013188 (1986)","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Structures and Algorithms\u00a014, 293\u2013308 (1999)","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.3.CO;2-7"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Lawler, G., Sokal, A.: Bounds on the L2 spectrum for Markov chains and Markov processes: a generalization of Cheeger\u2019s inequality. Trans. Amer. Math. Soc.\u00a0309, 557\u2013580 (1988)","DOI":"10.2307\/2000925"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Morris, B.: Improved bounds for sampling contingency tables. Random Structures & Algorithms\u00a021, 135\u2013146 (2002)","DOI":"10.1002\/rsa.10049"},{"key":"#cr-split#-31_CR15.1","unstructured":"Mount, J.: Application of convex sampling to optimization and contingency table generation, PhD thesis, Carnegie Mellon University (1995);"},{"key":"#cr-split#-31_CR15.2","unstructured":"Technical Report CMU-CS-95-152, Department of Computer Science"},{"key":"31_CR16","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:44:52Z","timestamp":1558421092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}