80 citations · 113 across the 26 of their papers we have counts for
5 papers · 1 filter
Echo-CGC: A Communication-Efficient Byzantine-tolerant Distributed Machine Learning Algorithm in Single-Hop Radio Network
Qinzi Zhang, Lewis Tseng
In this paper, we focus on a popular DML framework -- the parameter server computation paradigm and iterative learning algorithms that proceed in rounds. We aim to reduce the commu…
Amortized Constant Round Atomic Snapshot in Message-Passing Systems
Vijay Garg, Saptaparni Kumar, Lewis Tseng +1
We study the lattice agreement (LA) and atomic snapshot problems in asynchronous message-passing systems where up to nodes may crash. Our main result is a crash-tolerant atomic…
Reliable Broadcast in Practical Networks: Algorithm and Evaluation
Yingjian Wu, Haochen Pan, Saptaparni Kumar +1
Reliable broadcast is an important primitive to ensure that a source node can reliably disseminate a message to all the non-faulty nodes in an asynchronous and failure-prone networ…
Blockchain and Fog Computing for Cyberphysical Systems: The Case of Smart Industry
Ouns Bouachir, Moayad Aloqaily, Lewis Tseng +1
Blockchain has revolutionized how transactions are conducted by ensuring secure and auditable peer-to-peer coordination. This is due to both the development of decentralization, an…
Asynchronous Byzantine Approximate Consensus in Directed Networks
Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya
In this work, we study the approximate consensus problem in asynchronous message-passing networks where some nodes may become Byzantine faulty. We answer an open problem raised by…