Synchronous consensus under hybrid process and link failures
type: Item
instance of: scholarly article
title: Synchronous consensus under hybrid process and link failures
zbMATH Open document ID: 1223.68018
author: Martin Biely
author: Ulrich Schmid
author: Bettina Weiss
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 5955911
zbMATH Keywords: fault-tolerant distributed systems
zbMATH Keywords: Byzantine agreement
zbMATH Keywords: hybrid failure models
zbMATH Keywords: link failures
zbMATH Keywords: uniform consensus
zbMATH Keywords: authentication
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.09.032
OpenAlex ID: W2010075998
Wikidata QID: Q38762810
cites work: Q3126969
cites work: Distributed agreement in the presence of processor and communication faults
cites work: The Byzantine Generals Problem
cites work: The customizable fault/error model for dependable distributed systems.
cites work: Time is not a healer
cites work: Q5137898
cites work: Impossibility Results and Lower Bounds for Consensus under Link Failures
cites work: Operating systems. An advanced course
cites work: Agreement in synchronous networks with ubiquitous faults
cites work: A new solution for the Byzantine generals problem
cites work: Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: Tolerating corrupted communication
cites work: The Heard-Of model: computing in distributed systems with benign faults
cites work: A formally verified algorithm for clock synchronization under a hybrid fault model
cites work: New hybrid fault models for asynchronous approximate agreement
cites work: Orthogonal accuracy clock synchronization
cites work: How to reconcile fault-tolerant interval intersection with the Lipschitz condition
cites work: Exploiting omissive faults in synchronous approximate agreement
cites work: Atomic broadcast: From simple message diffusion to Byzantine agreement
cites work: Q4413396
cites work: A tradeoff between safety and liveness for randomized coordinated attack protocols
cites work: The Byzantine generals strike again
cites work: Uniform consensus is harder than consensus
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Q4869527
DOI: 10.1016/J.TCS.2010.09.032
DBLP publication ID: journals/tcs/BielySW11
description: scientific article; zbMATH DE number 5955911