{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:52:25Z","timestamp":1729648345388,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6284006","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"2681-2685","source":"Crossref","is-referenced-by-count":23,"title":["From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA"],"prefix":"10.1109","author":[{"given":"Chul-Ho","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Young","family":"Eun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Se-Young","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"17","article-title":"Network adiabatic theorem: An efficient randomized protocol for contention resolution","author":"shin","year":"0","journal-title":"Proc of ACM SIGMETRICS 2009"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033988"},{"key":"15","article-title":"Hardness of low delay network scheduling","author":"shah","year":"2009","journal-title":"IEEE Trans on Information Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811093"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/60.3.607"},{"journal-title":"Stochastic Processes","year":"1996","author":"ross","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1015346319"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462229"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935185"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511920950.017"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.2307\/3214953"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"journal-title":"Markov Chains and Mixing Times","year":"2009","author":"levin","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284006"},{"key":"5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1214\/154957804100000051","article-title":"On the Markov chain central limit theorem","volume":"1","author":"jones","year":"2004","journal-title":"Probability Surveys"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2035046"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935124"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.897"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06284006.pdf?arnumber=6284006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T23:28:43Z","timestamp":1498001323000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6284006\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6284006","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}