Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
type: Item
instance of: scholarly article
title: Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
zbMATH Open document ID: 1382.68032
author: Hamouma Moumen
author: Michel Raynal
author: Achour Mostefaoui
published in: Theoretical Computer Science
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6820653
zbMATH Keywords: asynchronous system
zbMATH Keywords: broadcast abstraction
zbMATH Keywords: Byzantine process
zbMATH Keywords: coin
zbMATH Keywords: crash failure
zbMATH Keywords: distributed algorithm
zbMATH Keywords: \(k\)-set agreement
zbMATH Keywords: message-passing system
zbMATH Keywords: randomized algorithm
zbMATH Keywords: signature-free algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.03.018
OpenAlex ID: W2603459283
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Minimal synchrony for Byzantine consensus
cites work: Asynchronous byzantine agreement protocols
cites work: Unreliable failure detectors for reliable distributed systems
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Impossibility of distributed consensus with one faulty process
cites work: Asynchronous Agreement and Its Relation with Error-Correcting Codes
cites work: Generalized Universality
cites work: Q5498755
cites work: The topological structure of asynchronous computability
cites work: Byzantine Agreement in Expected Polynomial Time
cites work: The Byzantine Generals Problem
cites work: Q3126969
cites work: Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
cites work: Conditions on input vectors for consensus solvability in asynchronous distributed systems
cites work: Reaching Agreement in the Presence of Faults
cites work: Concurrent Programming: Algorithms, Principles, and Foundations
cites work: Distributed universality
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
DOI: 10.1016/J.TCS.2017.03.018
description: scientific article; zbMATH DE number 6820653