{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T08:55:23Z","timestamp":1775120123538,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536418","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Message passing algorithms and improved LP decoding"],"prefix":"10.1145","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Constantinos","family":"Daskalakis","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"David","family":"Steurer","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/4234.1001666"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.990903"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.005"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"e_1_3_2_1_9_1","first-page":"213","volume-title":"Advanced mean field methods (Birmingham","author":"Frey B. J.","year":"1999","unstructured":"B. J. Frey and R. Koetter . The attenuated max-product algorithm . In Advanced mean field methods (Birmingham , 1999 ), Neural Inf. Process. Ser., pages 213 -- 227 . MIT Press , Cambridge, MA, 2001. B. J. Frey and R. Koetter. The attenuated max-product algorithm. In Advanced mean field methods (Birmingham, 1999), Neural Inf. Process. Ser., pages 213--227. MIT Press, Cambridge, MA, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"e_1_3_2_1_11_1","first-page":"353","volume-title":"SODA","author":"Guruswami V.","year":"2008","unstructured":"V. Guruswami , J. R. Lee , and A. A. Razborov . Almost euclidean subspaces of ln 1 via expander codes . In SODA , pages 353 -- 362 , 2008 . V. Guruswami, J. R. Lee, and A. A. Razborov. Almost euclidean subspaces of ln 1 via expander codes. In SODA, pages 353--362, 2008."},{"key":"e_1_3_2_1_12_1","first-page":"30","volume-title":"SODA","author":"Indyk P.","year":"2008","unstructured":"P. Indyk . Explicit constructions for compressed sensing of sparse signals . In SODA , pages 30 -- 33 , 2008 . P. Indyk. Explicit constructions for compressed sensing of sparse signals. In SODA, pages 30--33, 2008."},{"key":"e_1_3_2_1_13_1","volume-title":"Inaugural Workshop of the Center for Information Theory and its Applications, 2006","author":"Koetter R.","year":"2086","unstructured":"R. Koetter and P. O. Vontobel . On the block error probability of LP decoding of LDPC codes . In Inaugural Workshop of the Center for Information Theory and its Applications, 2006 . Available as eprint arXiv:cs\/060 2086 v1. R. Koetter and P. O. Vontobel. On the block error probability of LP decoding of LDPC codes. In Inaugural Workshop of the Center for Information Theory and its Applications, 2006. Available as eprint arXiv:cs\/0602086v1."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA","acronym":"STOC '09","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536418","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:08Z","timestamp":1750278368000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":16,"alternative-id":["10.1145\/1536414.1536418","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536418","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}