{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:36:38Z","timestamp":1756571798875,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1409416, 1733872"],"award-info":[{"award-number":["1409416, 1733872"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Toyota InfoTechnology Center"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331619","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"327-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model"],"prefix":"10.1145","author":[{"given":"Muhammad Samir","family":"Khan","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Syed Shalan","family":"Naqvi","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Nitin H.","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/872035.872065"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Computing: Fundamentals,Simulations and Advanced Topics","author":"Attiya Hagit","year":"2004","unstructured":"Hagit Attiya and Jennifer Welch . 2004 .Distributed Computing: Fundamentals,Simulations and Advanced Topics . John Wiley & Sons, Inc. , USA. Hagit Attiya and Jennifer Welch. 2004.Distributed Computing: Fundamentals,Simulations and Advanced Topics. John Wiley & Sons, Inc., USA."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1073814.1073841"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1323293.1294280"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2332432.2332490"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/s00145-005-0308-x"},{"key":"e_1_3_2_1_7_1","volume-title":"The Byzantine generals strike again.Journal of Algorithms3, 1","author":"Dolev Danny","year":"1982","unstructured":"Danny Dolev . 1982. The Byzantine generals strike again.Journal of Algorithms3, 1 ( 1982 ), 14--30. Danny Dolev. 1982. The Byzantine generals strike again.Journal of Algorithms3, 1 (1982), 14--30."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/BF01843568"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/335305.335363"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/s001459910002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1137\/S0895480198335215"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/2332432.2332491"},{"key":"e_1_3_2_1_13_1","volume-title":"Syed Shalan Naqvi, and Nitin H. Vaidya","author":"Khan Muhammad Samir","year":"2019","unstructured":"Muhammad Samir Khan , Syed Shalan Naqvi, and Nitin H. Vaidya . 2019 . Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. CoRRabs\/ 1903.11677 (2019). arXiv:1903.11677 http:\/\/arxiv.org\/abs\/1903.11677 Muhammad Samir Khan, Syed Shalan Naqvi, and Nitin H. Vaidya. 2019. Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. CoRRabs\/1903.11677 (2019). arXiv:1903.11677 http:\/\/arxiv.org\/abs\/1903.11677"},{"key":"e_1_3_2_1_14_1","volume-title":"Vaidya","author":"Khan Muhammad Samir","year":"2019","unstructured":"Muhammad Samir Khan and Nitin H . Vaidya . 2019 . Byzantine Consensus under Local Broadcast Model: Tight Sufficient Condition. CoRRabs\/ 1901. 03804 (2019). arXiv:1901.03804 http:\/\/arxiv.org\/abs\/1901.03804 Muhammad Samir Khan and Nitin H. Vaidya. 2019. Byzantine Consensus under Local Broadcast Model: Tight Sufficient Condition. CoRRabs\/1901. 03804 (2019). arXiv:1901.03804 http:\/\/arxiv.org\/abs\/1901.03804"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1011767.1011807"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/1146381.1146420"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/357172.357176"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/JSAC.2013.130413"},{"volume-title":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 710--719","author":"Li C.","unstructured":"C. Li , M. Hurfin , Y. Wang , and L. Yu . 2016. Towards a Restrained Use of Non-Equivocation for Achieving Iterative Approximate Byzantine Consensus . In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 710--719 . C. Li, M. Hurfin, Y. Wang, and L. Yu. 2016. Towards a Restrained Use of Non-Equivocation for Achieving Iterative Approximate Byzantine Consensus. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 710--719.","key":"e_1_3_2_1_19_1"},{"volume-title":"Distributed Algorithms","author":"Lynch Nancy A.","unstructured":"Nancy A. Lynch . 1996. Distributed Algorithms . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. Nancy A. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.","key":"e_1_3_2_1_20_1"},{"volume-title":"Nitin Vaidya). Master's thesis","author":"Naqvi Syed Shalan","unstructured":"Syed Shalan Naqvi . 2018. Exact Byzantine consensus under local-broadcast chan-nels ( Advisor : Nitin Vaidya). Master's thesis . University of Illinois at Urbana-Champaign. Syed Shalan Naqvi. 2018.Exact Byzantine consensus under local-broadcast chan-nels (Advisor: Nitin Vaidya). Master's thesis. University of Illinois at Urbana-Champaign.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","volume-title":"Muhammad Samir Khan, and Nitin H. Vaidya","author":"Naqvi Syed Shalan","year":"2018","unstructured":"Syed Shalan Naqvi , Muhammad Samir Khan, and Nitin H. Vaidya . 2018 . Exact Byzantine Consensus Under Local-Broadcast Model. CoRRabs\/ 1811. 08535 (2018). arXiv:1811. 08535 http:\/\/arxiv.org\/abs\/1811.08535 Syed Shalan Naqvi, Muhammad Samir Khan, and Nitin H. Vaidya. 2018. Exact Byzantine Consensus Under Local-Broadcast Model. CoRRabs\/1811. 08535 (2018). arXiv:1811. 08535 http:\/\/arxiv.org\/abs\/1811.08535"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/s00446-016-0279-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_25_1","first-page":"3","article-title":"Broadcasting with Locally Bounded Byzantine","volume":"93","author":"Pelc Andrzej","year":"2005","unstructured":"Andrzej Pelc and David Peleg . 2005 . Broadcasting with Locally Bounded Byzantine Faults. Inf. Process. Lett. 93 , 3 (Feb. 2005), 109--115. Andrzej Pelc and David Peleg. 2005. Broadcasting with Locally Bounded Byzantine Faults. Inf. Process. Lett.93, 3 (Feb. 2005), 109--115.","journal-title":"Faults. Inf. Process. Lett."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/73007.73014"},{"volume-title":"On Byzantine Agreement over (2,3)-Uniform Hypergraphs","author":"Ravikant D. V. S.","unstructured":"D. V. S. Ravikant , V. Muthuramakrishnan , V. Srikanth , K. Srinathan , and C. Pandu Rangan . 2004. On Byzantine Agreement over (2,3)-Uniform Hypergraphs . In Distributed Computing, Rachid Guerraoui (Ed.). Springer Berlin Heidelberg , Berlin ,Heidelberg, 450--464. D. V. S. Ravikant, V. Muthuramakrishnan, V. Srikanth, K. Srinathan, and C. Pandu Rangan. 2004. On Byzantine Agreement over (2,3)-Uniform Hypergraphs. In Distributed Computing, Rachid Guerraoui (Ed.). Springer Berlin Heidelberg, Berlin,Heidelberg, 450--464.","key":"e_1_3_2_1_27_1"},{"volume-title":"Iterative Approximate Byzantine Consensus under a Generalized Fault Model","author":"Tseng Lewis","unstructured":"Lewis Tseng and Nitin Vaidya . 2013. Iterative Approximate Byzantine Consensus under a Generalized Fault Model . In Distributed Computing and Networking, Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, and Prasun Sinha (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 72--86. Lewis Tseng and Nitin Vaidya. 2013. Iterative Approximate Byzantine Consensus under a Generalized Fault Model. In Distributed Computing and Networking, Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, and Prasun Sinha (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 72--86.","key":"e_1_3_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1016\/j.ipl.2014.11.010"},{"key":"e_1_3_2_1_30_1","volume-title":"Vaidya","author":"Tseng Lewis","year":"2012","unstructured":"Lewis Tseng and Nitin H . Vaidya . 2012 . Exact Byzantine Consensus in Directed Graphs. CoRRabs\/ 1208.5075 (2012). arXiv:1208.5075 http:\/\/arxiv.org\/abs\/1208.5075 Lewis Tseng and Nitin H. Vaidya. 2012. Exact Byzantine Consensus in Directed Graphs. CoRRabs\/1208.5075 (2012). arXiv:1208.5075 http:\/\/arxiv.org\/abs\/1208.5075"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/978-3-642-45249-9_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2332432.2332505"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1007\/s00145-001-0002-y"},{"volume-title":"2001.Introduction to graph theory","author":"West Douglas Brent","unstructured":"Douglas Brent West 2001.Introduction to graph theory . Vol. 2 . Prentice hall. Douglas Brent West et al.2001.Introduction to graph theory. Vol. 2. Prentice hall.","key":"e_1_3_2_1_34_1"},{"volume-title":"In2012 American Control Conference (ACC). 5855--5861","author":"Zhang H.","unstructured":"H. Zhang and S. Sundaram . 2012. Robustness of information diffusion algorithms to locally bounded adversaries . In2012 American Control Conference (ACC). 5855--5861 . H. Zhang and S. Sundaram. 2012. Robustness of information diffusion algorithms to locally bounded adversaries. In2012 American Control Conference (ACC). 5855--5861.","key":"e_1_3_2_1_35_1"}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC '19","name":"PODC '19: ACM Symposium on Principles of Distributed Computing","location":"Toronto ON Canada"},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331619","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331619","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:02Z","timestamp":1750208522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":35,"alternative-id":["10.1145\/3293611.3331619","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331619","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}