The fault-tolerant cluster-sending problem
type: Item
instance of: scholarly article
title: The fault-tolerant cluster-sending problem
DOI: 10.1007/978-3-031-11321-5_10
author: Jelle Hellings
author: Mohammad Sadoghi
publication date: 2022-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1908.01455
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T35
Mathematics Subject Classification ID: 68U35
zbMATH DE Number: 7630645
zbMATH Keywords: Byzantine failures
zbMATH Keywords: sharding
zbMATH Keywords: message sending
zbMATH Keywords: communication lower bounds
zbMATH Keywords: worst-case optimal communication
MaRDI profile type: Publication
OpenAlex ID: W2966516840
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Atomic Cross-Chain Swaps
cites work: Q3374942
cites work: HotStuff
description: scientific article; zbMATH DE number 7630645