{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:07Z","timestamp":1750221247590,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation of China","award":["61672275","61722207"],"award-info":[{"award-number":["61672275","61722207"]}]},{"name":"National Key R&D Program of China","award":["2018YFB1003202"],"award-info":[{"award-number":["2018YFB1003202"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,23]]},"DOI":"10.1145\/3212734.3212757","type":"proceedings-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T16:28:33Z","timestamp":1533054513000},"page":"189-198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["On Local Distributed Sampling and Counting"],"prefix":"10.1145","author":[{"given":"Weiming","family":"Feng","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250809"},{"key":"e_1_3_2_1_2_1","unstructured":"Weiming Feng Thomas P Hayes and Yitong Yin . 2018. Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). arXiv preprint arXiv:1802.06953 (2018).  Weiming Feng Thomas P Hayes and Yitong Yin . 2018. Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). arXiv preprint arXiv:1802.06953 (2018)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087815"},{"key":"e_1_3_2_1_4_1","unstructured":"Manuela Fischer and Mohsen Ghaffari . 2018. A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. arXiv preprint arXiv:1802.06676 (2018).  Manuela Fischer and Mohsen Ghaffari . 2018. A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. arXiv preprint arXiv:1802.06676 (2018)."},{"key":"e_1_3_2_1_5_1","unstructured":"David Gamarnik and Dmitriy Katz . 2007. Correlation decay and deterministic FPTAS for counting list-colorings of a graph SODA'07.   David Gamarnik and Dmitriy Katz . 2007. Correlation decay and deterministic FPTAS for counting list-colorings of a graph SODA'07."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20518"},{"key":"e_1_3_2_1_7_1","unstructured":"Mohsen Ghaffari David G Harris and Fabian Kuhn . 2017 a. On Derandomizing Local Distributed Algorithms. arXiv preprint arXiv:1711.02194 (2017).  Mohsen Ghaffari David G Harris and Fabian Kuhn . 2017 a. On Derandomizing Local Distributed Algorithms. arXiv preprint arXiv:1711.02194 (2017)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055410"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Mark Jerrum . 2003. Counting Sampling and Integrating: Algorithms and Complexity. Birkh:auser Basel.  Mark Jerrum . 2003. Counting Sampling and Integrating: Algorithms and Complexity. Birkh:auser Basel.","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Liang Li Pinyan Lu and Yitong Yin . 2013. Correlation decay up to uniqueness in spin systems SODA'13.   Liang Li Pinyan Lu and Yitong Yin . 2013. Correlation decay up to uniqueness in spin systems SODA'13.","DOI":"10.1137\/1.9781611973105.5"},{"key":"e_1_3_2_1_13_1","unstructured":"Marc Mezard and Andrea Montanari . 2009. Information physics and computation. Oxford University Press.   Marc Mezard and Andrea Montanari . 2009. Information physics and computation. Oxford University Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0017"},{"key":"e_1_3_2_1_16_1","unstructured":"Mark A Paskin and Carlos E Guestrin . 2004. Robust probabilistic inference in distributed systems UAI'04.   Mark A Paskin and Carlos E Guestrin . 2004. Robust probabilistic inference in distributed systems UAI'04."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"David Peleg . 2000. Distributed computing: a locality-sensitive approach. SIAM.   David Peleg . 2000. Distributed computing: a locality-sensitive approach. SIAM.","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.34"},{"key":"e_1_3_2_1_19_1","unstructured":"Renjie Song Yitong Yin and Jinman Zhao . 2016. Counting Hypergraph Matchings up to Uniqueness Threshold RANDOM'16.  Renjie Song Yitong Yin and Jinman Zhao . 2016. Counting Hypergraph Matchings up to Uniqueness Threshold RANDOM'16."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808740"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"}],"event":{"name":"PODC '18: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Egham United Kingdom","acronym":"PODC '18"},"container-title":["Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:44Z","timestamp":1750212464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":22,"alternative-id":["10.1145\/3212734.3212757","10.1145\/3212734"],"URL":"https:\/\/doi.org\/10.1145\/3212734.3212757","relation":{},"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"2018-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}