The fault-tolerant cluster-sending problem

DOI10.1007/978-3-031-11321-5_10OpenAlexW2966516840MaRDI QIDQ2103916

Mohammad Sadoghi, Jelle Hellings

Publication date: 9 December 2022

Full work available at URL: https://arxiv.org/abs/1908.01455

zbMATH Keywords

message sendingByzantine failurescommunication lower boundsshardingworst-case optimal communication

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (1)

Consensus in Data Management: From Distributed Commit to Blockchain

Cites Work

• Authenticated Algorithms for Byzantine Agreement
• HotStuff
• Atomic Cross-Chain Swaps
• Unnamed Item

This page was built for publication: The fault-tolerant cluster-sending problem