{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:08:48Z","timestamp":1772446128462,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250809","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"122-127","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Simple deterministic approximation algorithms for counting matchings"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Bayati","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gamarnik","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitriy","family":"Katz","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra","family":"Nair","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Tetali","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109655"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. 42nd IEEE Symposium on Foundations of Computer Science","author":"Berger N.","year":"2001","unstructured":"N. Berger , C. Kenyon , E. Mossel , and Y. Peres , Glauber dynamics on trees and hyperbolic graphs , Proc. 42nd IEEE Symposium on Foundations of Computer Science ( 2001 ). N. Berger, C. Kenyon, E. Mossel, and Y. Peres, Glauber dynamics on trees and hyperbolic graphs, Proc. 42nd IEEE Symposium on Foundations of Computer Science (2001)."},{"key":"e_1_3_2_1_3_1","volume-title":"Annual Allerton Conference on Communication, Control and Computing","author":"Bayati M.","year":"2006","unstructured":"M. Bayati and C. Nair , A rigorous proof of cavity method for counting matchings , Annual Allerton Conference on Communication, Control and Computing , 2006 . M. Bayati and C. Nair, A rigorous proof of cavity method for counting matchings, Annual Allerton Conference on Communication, Control and Computing, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1115049"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v24:4"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Gamarnik D.","year":"2007","unstructured":"D. Gamarnik and D. Katz , Correlation decay and deterministic FPTAS for counting list-colorings of a graph , Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2007 . D. Gamarnik and D. Katz, Correlation decay and deterministic FPTAS for counting list-colorings of a graph, Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.05.002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704445470"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050310"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01877590"},{"key":"e_1_3_2_1_11_1","volume-title":"Lectures in Mathematics","author":"Jerrum M.","unstructured":"M. Jerrum , Counting , sampling and integrating: algorithms and complexity , Lectures in Mathematics , ETH-Zurich , Birkhauser Verlag (2003) . M. Jerrum, Counting, sampling and integrating: algorithms and complexity, Lectures in Mathematics, ETH-Zurich, Birkhauser Verlag (2003)."},{"key":"e_1_3_2_1_12_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Jerrum M.","year":"1997","unstructured":"M. Jerrum and A. Sinclair , The Markov chain Monte Carlo method: an approach to approximate counting and integration , Approximation algorithms for NP-hard problems (D. Hochbaum, ed.), PWS Publishing Company , Boston, MA , 1997 . M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, Approximation algorithms for NP-hard problems (D. Hochbaum, ed.), PWS Publishing Company, Boston, MA, 1997."},{"key":"e_1_3_2_1_13_1","unstructured":"K. Jung and D. Shah Inference in Binary Pair-wise Markov Random Field through Self-Avoiding Walk Preprint on http:\/\/arxiv.org\/abs\/cs.AI\/0610111v2.  K. Jung and D. Shah Inference in Binary Pair-wise Markov Random Field through Self-Avoiding Walk Preprint on http:\/\/arxiv.org\/abs\/cs.AI\/0610111v2."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/11534.11537"},{"key":"e_1_3_2_1_16_1","first-page":"201","article-title":"Random matchings in regular graphs","volume":"8","author":"Kim JH.","year":"1998","unstructured":"JKahn and JH. Kim , Random matchings in regular graphs , Combinatorica 8 ( 1998 ), 201 -- 226 . JKahn and JH. Kim, Random matchings in regular graphs, Combinatorica 8 (1998), 201--226.","journal-title":"Combinatorica"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070007"},{"key":"e_1_3_2_1_18_1","volume-title":"Preprint in arXiv.org","author":"Montanari A.","year":"2006","unstructured":"A. Montanari and G. Semerjian , Rigorous inequalities between length and time scales in glassy systems , Preprint in arXiv.org ( 2006 ). A. Montanari and G. Semerjian, Rigorous inequalities between length and time scales in glassy systems, Preprint in arXiv.org (2006)."},{"key":"e_1_3_2_1_19_1","unstructured":"C. Nair and P. Tetali The correlation decay (CD) tree and strong spatial mixing in multi-spin systems Preprint on http:\/\/front.math.ucdavis.edu\/math.PR\/0701494.  C. Nair and P. Tetali The correlation decay (CD) tree and strong spatial mixing in multi-spin systems Preprint on http:\/\/front.math.ucdavis.edu\/math.PR\/0701494."},{"key":"e_1_3_2_1_20_1","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 A.","year":"1993","unstructured":"A. Sinclair , Algorithms for random generation and counting: a Markov chain approach , Birkhauser Progress in Theoretical Computer Science Series, Birkhauser Verlag ( 1993 ). A. Sinclair, Algorithms for random generation and counting: a Markov chain approach, Birkhauser Progress in Theoretical Computer Science Series, Birkhauser Verlag (1993)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797321602"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_23_1","volume-title":"CWI reports, PNA-R9813, ISSN 1386-3711","author":"van den Berg J.","year":"1998","unstructured":"J. van den Berg , On the absence of phase transition in the monomer-dimer model , CWI reports, PNA-R9813, ISSN 1386-3711 ( 1998 ). J. van den Berg, On the absence of phase transition in the monomer-dimer model, CWI reports, PNA-R9813, ISSN 1386-3711 (1998)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250809","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":24,"alternative-id":["10.1145\/1250790.1250809","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250809","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}