Renaming in synchronous message passing systems with Byzantine failures
type: Item
instance of: scholarly article
title: Renaming in synchronous message passing systems with Byzantine failures
zbMATH Open document ID: 1266.68059
author: Eli Gafni
author: Michael S. Okun
author: Amnon Barak
published in: Distributed Computing
publication date: 2013-06-20T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6177667
zbMATH Keywords: renaming problem
zbMATH Keywords: Byzantine failures
zbMATH Keywords: synchronous message passing model
MaRDI profile type: Publication
full work available at URL: s00446-007-0045-x
OpenAlex ID: W2042425246
cites work: Renaming in an asynchronous environment
cites work: Time bounds for decision problems in the presence of timing uncertainty and failures
cites work: Q2766870
cites work: Adaptive and efficient algorithms for lattice agreement and renaming
cites work: Q4398822
cites work: A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
cites work: Simplifying fault-tolerance
cites work: Immediate atomic snapshots and fast renaming
cites work: Fully-Adaptive Algorithms for Long-Lived Renaming
cites work: Wait-free implementations in message-passing systems
cites work: Impossibility of distributed consensus with one faulty process
cites work: Electing a leader in a synchronous ring
cites work: The topological structure of asynchronous computability
cites work: The Byzantine Generals Problem
cites work: Q3126969
cites work: Q4527024
cites work: Wait-free algorithms for fast, long-lived renaming
cites work: Automatically increasing the fault-tolerance of distributed algorithms
cites work: Efficient algorithms for anonymous Byzantine agreement
cites work: Renaming in Message Passing Systems with Byzantine Failures
cites work: Reaching Agreement in the Presence of Faults
DOI: 10.1007/S00446-007-0045-X
description: scientific article; zbMATH DE number 6177667