{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:40:24Z","timestamp":1774964424717,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,16]],"date-time":"2012-07-16T00:00:00Z","timestamp":1342396800000},"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":[[2012,7,16]]},"DOI":"10.1145\/2332432.2332505","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T14:38:27Z","timestamp":1342708707000},"page":"365-374","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":156,"title":["Iterative approximate byzantine consensus in arbitrary directed graphs"],"prefix":"10.1145","author":[{"given":"Nitin H.","family":"Vaidya","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Lewis","family":"Tseng","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Guanfeng","family":"Liang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IECON.2001.975602"},{"key":"e_1_3_2_1_2_1","volume-title":"International Journal of Parallel and Distributed Systems and Networks","author":"Azadmanesh M. H.","year":"2002","unstructured":"M. H. Azadmanesh and R. Kieckhafer . Asynchronous approximate agreement in partially connected networks . International Journal of Parallel and Distributed Systems and Networks , 2002 . http:\/\/ahvaz.unomaha.edu\/azad\/pubs\/ijpdsn.asyncpart.pdf M. H. Azadmanesh and R. Kieckhafer. Asynchronous approximate agreement in partially connected networks. International Journal of Parallel and Distributed Systems and Networks, 2002. http:\/\/ahvaz.unomaha.edu\/azad\/pubs\/ijpdsn.asyncpart.pdf"},{"key":"e_1_3_2_1_3_1","series-title":"Optimization and Neural Computation Series","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas D. P.","year":"1997","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis . Parallel and Distributed Computation: Numerical Methods . Optimization and Neural Computation Series . Athena Scientific , 1997 . D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Optimization and Neural Computation Series. Athena Scientific, 1997."},{"key":"e_1_3_2_1_4_1","volume-title":"Algorithms","author":"Dasgupta S.","year":"2006","unstructured":"S. Dasgupta , C. Papadimitriou , and U. Vazirani . Algorithms . McGraw-Hill Higher Education , 2006 . S. Dasgupta, C. Papadimitriou, and U. Vazirani. Algorithms. McGraw-Hill Higher Education, 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/10590.10597"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"issue":"6","key":"e_1_3_2_1_9_1","first-page":"988","article-title":"Coordination of groups of mobile autonomous agents using nearest neighbor rules. Automatic Control","volume":"48","author":"Jadbabaie A.","year":"2003","unstructured":"A. Jadbabaie , J. Lin , and A. Morse . Coordination of groups of mobile autonomous agents using nearest neighbor rules. Automatic Control , IEEE Transactions on , 48 ( 6 ): 988 -- 1001 , June 2003 . A. Jadbabaie, J. Lin, and A. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. Automatic Control, IEEE Transactions on, 48(6):988--1001, June 2003.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_10_1","volume-title":"Low cost approximate agreement in partially connected networks. J. of Computing and Information","author":"Kieckhafer R. M.","year":"1993","unstructured":"R. M. Kieckhafer and M. H. Azadmanesh . Low cost approximate agreement in partially connected networks. J. of Computing and Information , 1993 . http:\/\/ahvaz.ist.unomaha.edu\/azad\/pubs\/jci.syncpart.pdf R. M. Kieckhafer and M. H. Azadmanesh. Low cost approximate agreement in partially connected networks. J. of Computing and Information, 1993. http:\/\/ahvaz.ist.unomaha.edu\/azad\/pubs\/jci.syncpart.pdf"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967701.1967742"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185632.2185637"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185505.2185507"},{"key":"e_1_3_2_1_14_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms. Morgan Kaufmann , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_1_15_1","volume-title":"May","author":"Tseng L.","year":"2012","unstructured":"L. Tseng and N. H. Vaidya , \" Iterative Approximate Byzantine Consensusunder a Generalized Fault Model,\" report under preparation , May 2012 . L. Tseng and N. H. Vaidya, \"Iterative Approximate Byzantine Consensusunder a Generalized Fault Model,\" report under preparation, May 2012."},{"key":"e_1_3_2_1_18_1","volume-title":"March","author":"Vaidya N. H.","year":"2012","unstructured":"N. H. Vaidya , \"Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs,\" Tech. Rep. , University of Illinois , March 2012 . http:\/\/arxiv.org\/abs\/1203.1888 N. H. Vaidya, \"Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs,\" Tech. Rep., University of Illinois, March 2012. http:\/\/arxiv.org\/abs\/1203.1888"},{"key":"e_1_3_2_1_19_1","unstructured":"H. Zhang and S. Sundaram. Robustness of information diffusion algorithms to locally bounded adversaries. http:\/\/arxiv.org\/abs\/1110.3843 October 2011. A version to appear at ACC 2012as Robustness of Distributed Algorithms to Locally Bounded Adversaries.  H. Zhang and S. Sundaram. Robustness of information diffusion algorithms to locally bounded adversaries. http:\/\/arxiv.org\/abs\/1110.3843 October 2011. A version to appear at ACC 2012as Robustness of Distributed Algorithms to Locally Bounded Adversaries."}],"event":{"name":"PODC '12: ACM Symposium on Principles of Distributed Computing","location":"Madeira Portugal","acronym":"PODC '12","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","INESC-ID INESC-ID Lisboa"]},"container-title":["Proceedings of the 2012 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2332432.2332505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2332432.2332505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:44:39Z","timestamp":1750268679000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2332432.2332505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,16]]},"references-count":17,"alternative-id":["10.1145\/2332432.2332505","10.1145\/2332432"],"URL":"https:\/\/doi.org\/10.1145\/2332432.2332505","relation":{},"subject":[],"published":{"date-parts":[[2012,7,16]]},"assertion":[{"value":"2012-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}