The fault-tolerant cluster-sending problem

DOI10.1007/978-3-031-11321-5_10MaRDI QIDQ2103916zbMATH OpenOpenAlexFDO

Authors Jelle Hellings, Mohammad Sadoghi

Publication date 9 December 2022

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

zbMATH Keywords

Byzantine failurescommunication lower boundsmessage sendingshardingworst-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)

Cites work

• Atomic Cross-Chain Swaps
• Authenticated Algorithms for Byzantine Agreement
• HotStuff
• Practical threshold signatures

Cited in

(1)

• Consensus in Data Management: From Distributed Commit to Blockchain

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103916)