Improved communication complexity of fault-tolerant consensus-Reference-Cited by-同舟云学术

Improved communication complexity of fault-tolerant consensus

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Hajiaghayi Mohammad T.¹,Kowalski Dariusz R.²,Olkowski Jan¹

Affiliation:

1. University of Maryland, USA

2. Augusta University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520078

Reference31 articles.

1. Communication Complexity of Byzantine Agreement, Revisited

2. D. Alistarh , J. Aspnes , V. King , and J. Saia , Communication-eficient randomized consensus, Distributed Comput. , 31 ( 2018 ), 489 - 501 . D. Alistarh, J. Aspnes, V. King, and J. Saia, Communication-eficient randomized consensus, Distributed Comput., 31 ( 2018 ), 489-501.

3. D. Alistarh , S. Gilbert , R. Guerraoui , M. Zadimoghaddam , How Eficient Can Gossip Be? (On the Cost of Resilient Information Exchange), Automata, Languages and Programming , 37th International Colloquium, ICALP 2010 , 115 - 126 . D. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, How Eficient Can Gossip Be? (On the Cost of Resilient Information Exchange), Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, 115-126.

4. S. Amdur S. Weber and V. Hadzilacos On the message complexity of binary agreement under crash failures Distributed Computing 5 ( 1992 ) 175-186. S. Amdur S. Weber and V. Hadzilacos On the message complexity of binary agreement under crash failures Distributed Computing 5 ( 1992 ) 175-186.

5. J. Aspnes Lower Bounds for Distributed Coin-Flipping and Randomized Consensus J. ACM 45 ( 3 ) ( 1998 ): 415-450. J. Aspnes Lower Bounds for Distributed Coin-Flipping and Randomized Consensus J. ACM 45 ( 3 ) ( 1998 ): 415-450.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Anti-Counterfeiting and Traceability Consensus Algorithm Based on Weightage to Contributors in a Food Supply Chain of Industry 4.0;Sustainability;2023-05-11

2. On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement;IEEE Transactions on Parallel and Distributed Systems;2023

3. Improved communication complexity of fault-tolerant consensus;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09