{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:34:50Z","timestamp":1729647290602,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935185","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"371-375","source":"Crossref","is-referenced-by-count":34,"title":["Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling"],"prefix":"10.1109","author":[{"given":"Libin","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Leconte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Srikant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Walrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Distributed CSMA\/CA algorithms for achieving maximum throughput in wireless networks","author":"ni","year":"2009","journal-title":"Information Theory and Applications Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462229"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555365"},{"key":"ref13","article-title":"Hardness of low delay network scheduling","author":"shah","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.37236\/1552","article-title":"A note on the Glauber dynamics for sampling independnet sets","volume":"8","author":"vigoda","year":"2001","journal-title":"The Electronic Journal of Combinatorics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717965"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797741"},{"key":"ref5","article-title":"Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling","author":"jiang","year":"2010","journal-title":"Technical Report"},{"key":"ref8","article-title":"Maximizing utility via random access without message passing","author":"liu","year":"2008","journal-title":"Microsoft Research Technical Report"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400349"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1071"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096769"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48115-7_2"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935185.pdf?arnumber=5935185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T05:43:00Z","timestamp":1592718180000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935185\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935185","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}