Tight bounds for shared memory systems accessed by Byzantine processes
type: Item
instance of: scholarly article
title: Tight bounds for shared memory systems accessed by Byzantine processes
zbMATH Open document ID: 1264.68084
author: Noga Alon
author: Michael Merritt
author: Omer Reingold
author: Gadi Taubenfeld
published in: Distributed Computing
publication date: 2013-06-07T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6172093
zbMATH Keywords: keywords shared memory
zbMATH Keywords: Byzantine agreement
zbMATH Keywords: distributed consensus
zbMATH Keywords: sticky bits
describes a project that uses: JSR-166
MaRDI profile type: Publication
full work available at URL: s00446-005-0125-8
OpenAlex ID: W2006972261
Wikidata QID: Q59701086
cites work: Computing with faulty shared objects
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Wait-free Byzantine consensus.
cites work: Contention in shared memory algorithms
cites work: On the space complexity of randomized synchronization
cites work: Impossibility of distributed consensus with one faulty process
cites work: Q4860774
cites work: Randomized wait-free concurrent objects (extended abstract)
cites work: Fault-tolerant wait-free shared objects
cites work: An Optimistic Approach to Lock-Free FIFO Queues
cites work: Q2766890
cites work: A simple proof of a simple consensus algorithm
DBLP publication ID: journals/dc/AlonMRTW05
DOI: 10.1007/S00446-005-0125-8
description: scientific article; zbMATH DE number 6172093