{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:43:02Z","timestamp":1782970982515,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"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":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993809","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Error-free multi-valued consensus with byzantine failures"],"prefix":"10.1145","author":[{"given":"Guanfeng","family":"Liang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_16"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802632"},{"key":"e_1_3_2_1_3_1","volume-title":"Bit optimal distributed consensus. Computer science: research and applications","author":"Berman P.","year":"1992","unstructured":"P. Berman , J. A. Garay , and K. J. Perry . Bit optimal distributed consensus. Computer science: research and applications , 1992 . P. Berman, J. A. Garay, and K. J. Perry. Bit optimal distributed consensus. Computer science: research and applications, 1992."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.127443"},{"key":"e_1_3_2_1_5_1","volume-title":"Communications in Information and Systems","author":"Cai N.","year":"2006","unstructured":"N. Cai and R. W. Yeung . Network error correction, part ii: Lower bounds . Communications in Information and Systems , 2006 . N. Cai and R. W. Yeung. Network error correction, part ii: Lower bounds. Communications in Information and Systems, 2006."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90004-Y"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146407"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.78"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835798"},{"key":"e_1_3_2_1_12_1","volume-title":"UIUC","author":"Liang G.","year":"2010","unstructured":"G. Liang and N. Vaidya . Complexity of multi-valued byzantine agreement. Tech-Report , UIUC , June 2010 . G. Liang and N. Vaidya. Complexity of multi-valued byzantine agreement. Tech-Report, UIUC, June 2010."},{"key":"e_1_3_2_1_13_1","volume-title":"UIUC","author":"Liang G.","year":"2010","unstructured":"G. Liang and N. Vaidya . Multiparty equality function computation in networks with point-to-point links. Tech-Report , UIUC , October 2010 . G. Liang and N. Vaidya. Multiparty equality function computation in networks with point-to-point links. Tech-Report, UIUC, October 2010."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935257"},{"key":"e_1_3_2_1_15_1","volume-title":"UIUC","author":"Liang G.","year":"2011","unstructured":"G. Liang and N. Vaidya . Capacity of byzantine consensus with capacity limited point-to-point links. Tech-Report , UIUC , March 2011 . G. Liang and N. Vaidya. Capacity of byzantine consensus with capacity limited point-to-point links. Tech-Report, UIUC, March 2011."},{"key":"e_1_3_2_1_16_1","volume-title":"UIUC, under preparation (as of","author":"Liang G.","year":"2011","unstructured":"G. Liang and N. Vaidya . New efficient error-free multi-valued consensus with byzantine failures. Tech-Report , UIUC, under preparation (as of March 2011 ). G. Liang and N. Vaidya. New efficient error-free multi-valued consensus with byzantine failures. Tech-Report, UIUC, under preparation (as of March 2011)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675147"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/230303.230311"},{"key":"e_1_3_2_1_19_1","volume-title":"Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience. Cryptology ePrint Archive","author":"Patra A.","year":"2009","unstructured":"A. Patra and C. P. Rangan . Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience. Cryptology ePrint Archive , 2009 . A. Patra and C. P. Rangan. Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience. Cryptology ePrint Archive, 2009."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.580435"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264748"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"e_1_3_2_1_25_1","volume-title":"Communications in Information and Systems","author":"Yeung R. W.","year":"2006","unstructured":"R. W. Yeung and N. Cai . Network error correction, part i: Basic concepts and upper bounds . Communications in Information and Systems , 2006 . R. W. Yeung and N. Cai. Network error correction, part i: Basic concepts and upper bounds. Communications in Information and Systems, 2006."}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","location":"San Jose California USA","acronym":"PODC '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993809","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":24,"alternative-id":["10.1145\/1993806.1993809","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993809","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}