default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNitin H. Vaidya
Person information
- affiliation: University of Illinois Urbana-Champaign, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j87]Lewis Tseng, Guanfeng Liang, Nitin H. Vaidya:
Iterative approximate Byzantine consensus in arbitrary directed graphs. Distributed Comput. 37(3): 225-246 (2024)- [i78]Shuo Liu, Nitin H. Vaidya:
Byzantine fault-tolerant distributed set intersection with redundancy. CoRR abs/2402.08809 (2024) - 2023
- [j86]Nirupam Gupta
, Thinh T. Doan, Nitin H. Vaidya:
Byzantine Fault-Tolerance in Federated Local SGD Under $2f$-Redundancy. IEEE Trans. Control. Netw. Syst. 10(4): 1669-1681 (2023) - [c173]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Impact of Redundancy on Resilience in Distributed Optimization and Learning. ICDCN 2023: 80-89 - 2022
- [c172]Calvin Newport, Nitin H. Vaidya, Alex Weaver:
Preparing for Disaster: Leveraging Precomputation to Efficiently Repair Graph Structures Upon Failures. SPAA 2022: 63-74 - [i77]Shuo Liu, Nitin H. Vaidya:
Byzantine Fault-Tolerant Min-Max Optimization. CoRR abs/2205.14881 (2022) - [i76]Sandeep S. Kulkarni, Duong N. Nguyen, Lewis Tseng, Nitin H. Vaidya:
Impact of the Consistency Model on Checkpointing of Distributed Shared Memory. CoRR abs/2208.02411 (2022) - [i75]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Impact of Redundancy on Resilience in Distributed Optimization and Learning. CoRR abs/2211.08622 (2022) - 2021
- [j85]Nirupam Gupta, Shripad Gade, Nikhil Chopra, Nitin H. Vaidya:
Preserving Statistical Privacy in Distributed Optimization. IEEE Control. Syst. Lett. 5(3): 779-784 (2021) - [j84]Lili Su, Nitin H. Vaidya:
Byzantine-Resilient Multiagent Optimization. IEEE Trans. Autom. Control. 66(5): 2227-2233 (2021) - [c171]Nirupam Gupta, Thinh T. Doan, Nitin H. Vaidya:
Byzantine Fault-Tolerance in Decentralized Optimization under 2f-Redundancy. ACC 2021: 3632-3637 - [c170]Nirupam Gupta, Shuo Liu, Nitin H. Vaidya:
Byzantine Fault-Tolerant Distributed Machine Learning with Norm-Based Comparative Gradient Elimination. DSN Workshops 2021: 175-181 - [c169]Seth Gilbert, Calvin Newport, Nitin H. Vaidya, Alex Weaver:
Contention Resolution with Predictions. PODC 2021: 127-137 - [c168]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Approximate Byzantine Fault-Tolerance in Distributed Optimization. PODC 2021: 379-389 - [c167]Nitin H. Vaidya:
Security and Privacy for Distributed Optimization & Distributed Machine Learning. PODC 2021: 573 - [c166]Muhammad Samir Khan, Nitin H. Vaidya:
Testing Equality Under the Local Broadcast Model. SIROCCO 2021: 262-276 - [c165]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Redundancy in cost functions for Byzantine fault-tolerant federated learning. ResilientFL 2021: 4-6 - [c164]Muhammad Samir Khan, Nitin H. Vaidya:
Byzantine Consensus with Local Multicast Channels. DISC 2021: 26:1-26:16 - [i74]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Approximate Byzantine Fault-Tolerance in Distributed Optimization. CoRR abs/2101.09337 (2021) - [i73]Nirupam Gupta, Nitin H. Vaidya:
Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent. CoRR abs/2101.12316 (2021) - [i72]Seth Gilbert, Calvin Newport, Nitin H. Vaidya, Alex Weaver:
Contention Resolution with Predictions. CoRR abs/2105.12706 (2021) - [i71]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Asynchronous Distributed Optimization with Redundancy in Cost Functions. CoRR abs/2106.03998 (2021) - [i70]Nirupam Gupta, Thinh T. Doan, Nitin H. Vaidya:
Byzantine Fault-Tolerance in Federated Local SGD under 2f-Redundancy. CoRR abs/2108.11769 (2021) - [i69]Muhammad Samir Khan, Nitin H. Vaidya:
Byzantine Consensus in Directed Hypergraphs. CoRR abs/2109.01205 (2021) - [i68]Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Utilizing Redundancy in Cost Functions for Resilience in Distributed Optimization and Learning. CoRR abs/2110.10858 (2021) - 2020
- [c163]Zhuolun Xiang, Nitin H. Vaidya:
Global Stabilization for Causally Consistent Partial Replication. ICDCN 2020: 30:1-30:10 - [c162]Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Asynchronous Byzantine Approximate Consensus in Directed Networks. PODC 2020: 149-158 - [c161]Nirupam Gupta, Nitin H. Vaidya:
Fault-Tolerance in Distributed Optimization: The Case of Redundancy. PODC 2020: 365-374 - [c160]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. DISC 2020: 28:1-28:17 - [i67]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. CoRR abs/2002.11321 (2020) - [i66]Nirupam Gupta, Nitin H. Vaidya:
Resilience in Collaborative Optimization: Redundant and Independent Cost Functions. CoRR abs/2003.09675 (2020) - [i65]Nirupam Gupta, Shripad Gade, Nikhil Chopra, Nitin H. Vaidya:
Preserving Statistical Privacy in Distributed Optimization. CoRR abs/2004.01312 (2020) - [i64]Shripad Gade, Ji Liu, Nitin H. Vaidya:
A Private and Finite-Time Algorithm for Solving a Distributed System of Linear Equations. CoRR abs/2004.04680 (2020) - [i63]Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Asynchronous Byzantine Approximate Consensus in Directed Networks. CoRR abs/2004.09054 (2020) - [i62]Nirupam Gupta, Shuo Liu, Nitin H. Vaidya:
Byzantine Fault-Tolerant Distributed Machine Learning Using Stochastic Gradient Descent (SGD) and Norm-Based Comparative Gradient Elimination (CGE). CoRR abs/2008.04699 (2020) - [i61]Nirupam Gupta, Thinh T. Doan, Nitin H. Vaidya:
Byzantine Fault-Tolerance in Decentralized Optimization under Minimal Redundancy. CoRR abs/2009.14763 (2020)
2010 – 2019
- 2019
- [j83]Lili Su, Nitin H. Vaidya:
Defending non-Bayesian learning against adversarial attacks. Distributed Comput. 32(4): 277-289 (2019) - [c159]Nirupam Gupta, Nitin H. Vaidya:
Byzantine Fault-Tolerant Parallelized Stochastic Gradient Descent for Linear Regression. Allerton 2019: 415-420 - [c158]Pooja Vyavahare, Lili Su, Nitin H. Vaidya:
Distributed Learning over Time-Varying Graphs with Adversarial Agents. FUSION 2019: 1-8 - [c157]Muhammad Samir Khan, Lewis Tseng, Nitin H. Vaidya:
Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model. OPODIS 2019: 30:1-30:16 - [c156]Muhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya:
Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. PODC 2019: 327-336 - [c155]Zhuolun Xiang, Nitin H. Vaidya:
Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm. PODC 2019: 425-434 - [e7]R. C. Hansdah, Dilip Krishnaswamy, Nitin H. Vaidya:
Proceedings of the 20th International Conference on Distributed Computing and Networking, ICDCN 2019, Bangalore, India, January 04-07, 2019. ACM 2019, ISBN 978-1-4503-6094-4 [contents] - [i60]Pooja Vyavahare, Lili Su, Nitin H. Vaidya:
Distributed Learning with Adversarial Agents Under Relaxed Network Condition. CoRR abs/1901.01943 (2019) - [i59]Muhammad Samir Khan, Nitin H. Vaidya:
Byzantine Consensus under Local Broadcast Model: Tight Sufficient Condition. CoRR abs/1901.03804 (2019) - [i58]Nirupam Gupta, Nitin H. Vaidya:
Byzantine Fault Tolerant Distributed Linear Regression. CoRR abs/1903.08752 (2019) - [i57]Muhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya:
Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. CoRR abs/1903.11677 (2019) - [i56]Muhammad Samir Khan, Nitin H. Vaidya:
Asynchronous Byzantine Consensus on Undirected Graphs under Local Broadcast Model. CoRR abs/1909.02865 (2019) - [i55]Muhammad Samir Khan, Lewis Tseng, Nitin H. Vaidya:
Exact Byzantine Consensus on Arbitrary Directed Graphs under Local Broadcast Model. CoRR abs/1911.07298 (2019) - [i54]Nirupam Gupta, Nitin H. Vaidya:
Randomized Reactive Redundancy for Byzantine Fault-Tolerance in Parallelized Learning. CoRR abs/1912.09528 (2019) - 2018
- [j82]Tarek F. Abdelzaher, Nora Ayanian, Tamer Basar, Suhas N. Diggavi, Jana Diesner, Deepak Ganesan, Ramesh Govindan, Susmit Jha, Tancrède Lepoint, Benjamin M. Marlin, Klara Nahrstedt, David M. Nicol, Raj Rajkumar, Stephen Russell, Sanjit A. Seshia, Fei Sha, Prashant J. Shenoy, Mani B. Srivastava, Gaurav S. Sukhatme, Ananthram Swami, Paulo Tabuada, Don Towsley, Nitin H. Vaidya, Venugopal V. Veeravalli:
Toward an Internet of Battlefield Things: A Resilience Perspective. Computer 51(11): 24-36 (2018) - [j81]Fan Wu, Tong Meng, Aijing Li, Guihai Chen, Nitin H. Vaidya:
Have You Recorded My Voice: Toward Robust Neighbor Discovery in Mobile Wireless Networks. IEEE/ACM Trans. Netw. 26(3): 1432-1445 (2018) - [c154]Shripad Gade, Nitin H. Vaidya:
Private Optimization on Networks. ACC 2018: 1402-1409 - [c153]Shripad Gade, Nitin H. Vaidya:
Privacy-Preserving Distributed Learning via Obfuscated Stochastic Gradients. CDC 2018: 184-191 - [c152]Tarek F. Abdelzaher, Nora Ayanian, Tamer Basar, Suhas N. Diggavi, Jana Diesner, Deepak Ganesan, Ramesh Govindan, Susmit Jha, Tancrède Lepoint, Benjamin M. Marlin, Klara Nahrstedt, David M. Nicol, Raj Rajkumar, Stephen Russell, Sanjit A. Seshia, Fei Sha, Prashant J. Shenoy, Mani B. Srivastava, Gaurav S. Sukhatme, Ananthram Swami, Paulo Tabuada, Don Towsley, Nitin H. Vaidya, Venugopal V. Veeravalli:
Will Distributed Computing Revolutionize Peace? The Emergence of Battlefield IoT. ICDCS 2018: 1129-1138 - [c151]Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Effects of Topology Knowledge and Relay Depth on Asynchronous Appoximate Consensus. OPODIS 2018: 14:1-14:16 - [c150]Zhuolun Xiang, Nitin H. Vaidya:
Brief Announcement: Partially Replicated Causally Consistent Shared Memory. PODC 2018: 273-275 - [c149]Russell L. Jones, Muhammad Samir Khan, Nitin H. Vaidya:
Brief Announcement: Optimal Record and Replay under Causal Consistency. PODC 2018: 277-279 - [c148]Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus. DISC 2018: 51:1-51:4 - [i53]Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Asynchronous Crash-Tolerant Consensus in Directed Graphs: Randomization and Topology Knowledge. CoRR abs/1803.04513 (2018) - [i52]Zhuolun Xiang, Nitin H. Vaidya:
Global Stabilization for Causally Consistent Partial Replication. CoRR abs/1803.05575 (2018) - [i51]Russell L. Jones, Muhammad Samir Khan, Nitin H. Vaidya:
Optimal Record and Replay under Causal Consistency. CoRR abs/1805.08804 (2018) - [i50]Syed Shalan Naqvi, Muhammad Samir Khan, Nitin H. Vaidya:
Exact Byzantine Consensus Under Local-Broadcast Model. CoRR abs/1811.08535 (2018) - 2017
- [j80]Lili Su, Nitin H. Vaidya:
Reaching approximate Byzantine consensus with multi-hop communication. Inf. Comput. 255: 352-368 (2017) - [j79]Muntasir Raihan Rahman, Lewis Tseng, Son Nguyen, Indranil Gupta, Nitin H. Vaidya:
Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-Value Stores. ACM Trans. Auton. Adapt. Syst. 11(4): 20:1-20:36 (2017) - [c147]Sandeep S. Kulkarni, Nitin H. Vaidya:
Effectiveness of Delaying Timestamp Computation. PODC 2017: 263-272 - [i49]Zhuolun Xiang, Nitin H. Vaidya:
Lower Bounds and Algorithm for Partially Replicated Causally Consistent Shared Memory. CoRR abs/1703.05424 (2017) - [i48]Shripad Gade, Nitin H. Vaidya:
Private Learning on Networks: Part II. CoRR abs/1703.09185 (2017) - 2016
- [j78]Lewis Tseng, Nitin H. Vaidya:
A Note on Fault-tolerant Consensus in Directed Networks. SIGACT News 47(3): 70-91 (2016) - [j77]Christoforos N. Hadjicostis, Nitin H. Vaidya, Alejandro D. Domínguez-García:
Robust Distributed Average Consensus via Exchange of Running Sums. IEEE Trans. Autom. Control. 61(6): 1492-1507 (2016) - [c146]Lili Su, Nitin H. Vaidya:
Multi-agent optimization in the presence of Byzantine adversaries: Fundamental limits. ACC 2016: 7183-7188 - [c145]Ghazale Hosseinabadi, Nitin H. Vaidya:
Concurrent-MAC: Increasing concurrent transmissions in dense wireless LANs. ICNC 2016: 1-5 - [c144]Zhuolun Xiang, Nitin H. Vaidya:
Relaxed Byzantine Vector Consensus. OPODIS 2016: 26:1-26:15 - [c143]Lili Su, Nitin H. Vaidya:
Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms. PODC 2016: 425-434 - [c142]Zhuolun Xiang, Nitin H. Vaidya:
Brief Announcement: Relaxed Byzantine Vector Consensus. SPAA 2016: 401-403 - [c141]Lili Su, Nitin H. Vaidya:
Asynchronous Non-Bayesian Learning in the Presence of Crash Failures. SSS 2016: 352-367 - [c140]Lili Su, Nitin H. Vaidya:
Robust Multi-agent Optimization: Coping with Byzantine Agents with Input Redundancy. SSS 2016: 368-382 - [c139]Lili Su, Nitin H. Vaidya:
Non-Bayesian Learning in the Presence of Byzantine Agents. DISC 2016: 414-427 - [i47]Zhuolun Xiang, Nitin H. Vaidya:
Relaxed Byzantine Vector Consensus. CoRR abs/1601.08067 (2016) - [i46]Lili Su, Nitin H. Vaidya:
Asynchronous Distributed Hypothesis Testing in the Presence of Crash Failures. CoRR abs/1606.03418 (2016) - [i45]Nitin H. Vaidya, Sandeep S. Kulkarni:
Efficient Timestamps for Capturing Causality. CoRR abs/1606.05962 (2016) - [i44]Lili Su, Nitin H. Vaidya:
Defending Non-Bayesian Learning against Adversarial Attacks. CoRR abs/1606.08883 (2016) - [i43]Lili Su, Nitin H. Vaidya:
Robust Multi-Agent Optimization: Coping with Packet-Dropping Link Failures. CoRR abs/1606.08904 (2016) - [i42]Shripad Gade, Nitin H. Vaidya:
Distributed Optimization for Client-Server Architecture with Negative Gradient Weights. CoRR abs/1608.03866 (2016) - [i41]Shripad Gade, Nitin H. Vaidya:
Distributed Optimization of Convex Sum of Non-Convex Functions. CoRR abs/1608.05401 (2016) - [i40]Zhuolun Xiang, Nitin H. Vaidya:
Timestamps for Partial Replication. CoRR abs/1611.04022 (2016) - [i39]Shripad Gade, Nitin H. Vaidya:
Private Learning on Networks. CoRR abs/1612.05236 (2016) - 2015
- [j76]Hammurabi Mendes, Maurice Herlihy, Nitin H. Vaidya, Vijay K. Garg:
Multidimensional agreement in Byzantine systems. Distributed Comput. 28(6): 423-441 (2015) - [j75]Lewis Tseng, Nitin H. Vaidya, Vartika Bhandari:
Broadcast using certified propagation algorithm in presence of Byzantine faults. Inf. Process. Lett. 115(4): 512-514 (2015) - [c138]Tong Meng, Fan Wu, Aijing Li, Guihai Chen, Nitin H. Vaidya:
On robust neighbor discovery in mobile wireless networks. CoNEXT 2015: 38:1-38:13 - [c137]Zhenqi Huang, Sayan Mitra, Nitin H. Vaidya:
Differentially Private Distributed Optimization. ICDCN 2015: 4:1-4:10 - [c136]Shehla S. Rana, Nitin H. Vaidya:
iPath: Intelligent and optimal path selection for Byzantine fault tolerant communication. INFOCOM 2015: 1095-1103 - [c135]Shegufta Bakht Ahsan, Nitin H. Vaidya:
O-ACK: An adaptive wireless MAC protocol exploiting opportunistic token-passing and ack piggybacking. LCN 2015: 410-413 - [c134]Lewis Tseng, Nitin H. Vaidya:
Fault-Tolerant Consensus in Directed Graphs. PODC 2015: 451-460 - [c133]Juan Jose Galvez, Nitin H. Vaidya:
Dynamic switching with heterogeneous channels in multichannel 802.11 WLANs. SECON 2015: 109-117 - [c132]Shegufta Bakht Ahsan, Nitin H. Vaidya:
Optimized O-ACK: An adaptive wireless MAC protocol for multiple access points. SECON 2015: 163-165 - [c131]Syeda Persia Aziz, Nitin H. Vaidya:
Improving reliability and performance of dense-AP network using DAPnet. SECON 2015: 175-177 - [c130]Lili Su, Nitin H. Vaidya:
Reaching Approximate Byzantine Consensus with Multi-hop Communication. SSS 2015: 21-35 - [i38]Lewis Tseng, Nitin H. Vaidya:
Byzantine Broadcast Under a Selective Broadcast Model for Single-hop Wireless Networks. CoRR abs/1502.00075 (2015) - [i37]Lewis Tseng, Alec Benzer, Nitin H. Vaidya:
Application-Aware Consistency: An Application to Social Network. CoRR abs/1502.04395 (2015) - [i36]Lili Su, Nitin H. Vaidya:
Byzantine Multi-Agent Optimization: Part I. CoRR abs/1506.04681 (2015) - [i35]Lili Su, Nitin H. Vaidya:
Byzantine Multi-Agent Optimization: Part II. CoRR abs/1507.01845 (2015) - [i34]Lili Su, Nitin H. Vaidya:
Fault-Tolerant Multi-Agent Optimization: Part III. CoRR abs/1509.01864 (2015) - [i33]Muntasir Raihan Rahman, Lewis Tseng, Son Nguyen, Indranil Gupta, Nitin H. Vaidya:
Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-value Stores. CoRR abs/1509.02464 (2015) - [i32]Lili Su, Nitin H. Vaidya:
Fault-Tolerant Distributed Optimization (Part IV): Constrained Optimization with Arbitrary Directed Networks. CoRR abs/1511.01821 (2015) - 2014
- [c129]Nitin H. Vaidya:
Iterative Byzantine Vector Consensus in Incomplete Graphs. ICDCN 2014: 14-28 - [c128]Hongxing Li, Nitin H. Vaidya:
Optimal CSMA-based wireless communication with worst-case delay and non-uniform sizes. INFOCOM 2014: 2526-2534 - [c127]Shegufta Bakht Ahsan, Nitin H. Vaidya:
Overheard ACK with token passing: an optimization to 802.11 MAC protocol. S3@MobiCom 2014: 9-12 - [c126]Shegufta Bakht Ahsan, Nitin H. Vaidya:
Poster: overheard ACK with token passing: an optimization to 802.11 MAC protocol. MobiCom 2014: 345-346 - [c125]Lewis Tseng, Nitin H. Vaidya:
Iterative Approximate Consensus in the Presence of Byzantine Link Failures. NETYS 2014: 84-98 - [c124]Lewis Tseng, Nitin H. Vaidya:
Asynchronous convex hull consensus in the presence of crash faults. PODC 2014: 396-405 - [i31]Zhenqi Huang, Sayan Mitra, Nitin H. Vaidya:
Differentially Private Distributed Optimization. CoRR abs/1401.2596 (2014) - [i30]Hongxing Li, Nitin H. Vaidya:
Optimal CSMA-based Wireless Communication with Worst-case Delay and Non-uniform Sizes. CoRR abs/1401.3511 (2014) - [i29]Lewis Tseng, Nitin H. Vaidya:
Iterative Approximate Consensus in the presence of Byzantine Link Failures. CoRR abs/1401.6615 (2014) - [i28]Lewis Tseng, Nitin H. Vaidya:
Asynchronous Convex Consensus in the Presence of Crash Faults. CoRR abs/1403.3455 (2014) - [i27]Lili Su, Nitin H. Vaidya:
Reaching Approximate Byzantine Consensus with Multi-hop Communication. CoRR abs/1411.5282 (2014) - [i26]Lewis Tseng, Nitin H. Vaidya:
Crash-Tolerant Consensus in Directed Graphs. CoRR abs/1412.8532 (2014) - 2013
- [j74]Fan Wu, Nitin H. Vaidya:
A Strategy-Proof Radio Spectrum Auction Mechanism in Noncooperative Wireless Networks. IEEE Trans. Mob. Comput. 12(5): 885-894 (2013) - [j73]Tae Hyun Kim, Jian Ni, R. Srikant, Nitin H. Vaidya:
Throughput-Optimal CSMA With Imperfect Carrier Sensing. IEEE/ACM Trans. Netw. 21(5): 1636-1650 (2013) - [c123]Ghazale Hosseinabadi, Nitin H. Vaidya:
Token-DCF: An opportunistic MAC protocol for wireless networks. COMSNETS 2013: 1-9 - [c122]Lewis Tseng, Nitin H. Vaidya:
Iterative Approximate Byzantine Consensus under a Generalized Fault Model. ICDCN 2013: 72-86 - [c121]Ghazale Hosseinabadi, Nitin H. Vaidya:
Concurrent-MAC: increasing concurrent transmissions in multi-AP wireless lans. MobiCom 2013: 227-230 - [c120]Nitin H. Vaidya, Vijay K. Garg:
Byzantine vector consensus in complete graphs. PODC 2013: 65-73 - [i25]