Reaching approximate agreement in the presence of faults
From MaRDI portal
Publication:3763582
DOI10.1145/5925.5931zbMath0627.68027OpenAlexW2126906505WikidataQ60305000 ScholiaQ60305000MaRDI QIDQ3763582
Shlomit S. Pinter, Eugene W. Stark, William E. Weihl, Danny Dolev, Nancy A. Lynch
Publication date: 1986
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/5925.5931
terminationasynchronous systemsynchronous systemsfaulty processesasynchronous agreement algorithmByzantine Generals Problem
Related Items
Consensus in Data Management: From Distributed Commit to Blockchain, Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Synchronous condition-based consensus, Unnamed Item, Boltzmann machines as a model for parallel annealing, A new fault-tolerant algorithm for clock synchronization, From wait-free to arbitrary concurrent solo executions in colorless distributed computing, Genuinely distributed Byzantine machine learning, Power and limits of distributed computing shared memory models, Communication Complexity of Wait-Free Computability in Dynamic Networks, Asynchronous fully-decentralized SGD in the cluster-based model, Secure multi-dimensional consensus algorithm against malicious attacks, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, Byzantine preferential voting, Multidimensional agreement in Byzantine systems, Bipartite Byzantine‐resilient event‐triggered consensus control of heterogeneous multi‐agent systems, Submodularity-based false data injection attack scheme in multi-agent dynamical systems, Byzantine-resilient distributed observers for LTI systems, Self-stabilizing gathering of mobile robots under crash or Byzantine faults, Locality and checkability in wait-free computing, Hundreds of impossibility results for distributed computing, Condition-based consensus solvability: a hierarchy of conditions and efficient protocols, A simple characterization of asynchronous computations, Resilient Distributed Field Estimation, Fault-tolerant critical section management in asynchronous environments, Consensus of second-order multi-agent systems in the presence of locally bounded faults, Resilience against misbehaving nodes in asynchronous networks, Tight bounds on the round complexity of distributed 1-solvable tasks, A self-adjusting algorithm for Byzantine agreement, Approximate agreement under mobile Byzantine faults, Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms, Reaching approximate Byzantine consensus with multi-hop communication, Strong order-preserving renaming in the synchronous message passing model, Optimal Byzantine-resilient convergence in uni-dimensional robot networks, Unnamed Item, Broadcast using certified propagation algorithm in presence of Byzantine faults, Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects, Reaching Approximate Byzantine Consensus with Multi-hop Communication, Wait-free solvability of colorless tasks in anonymous shared-memory model, Self-stabilizing Byzantine clock synchronization with optimal precision, Wait-free approximate agreement on graphs, Wait-free approximate agreement on graphs, Locality and Checkability in Wait-Free Computing, Oblivious Collaboration, Fast Multidimensional Asymptotic and Approximate Consensus, Resilient output regulation in heterogeneous networked systems under Byzantine agents, Defending non-Bayesian learning against adversarial attacks, Recent Results on Fault-Tolerant Consensus in Message-Passing Networks, A flexible formal framework for masking/demasking faults, Resilient multi-dimensional consensus in adversarial environment, Fault-tolerant algorithms for tick-generation in asynchronous logic, Necessary and sufficient conditions for broadcast consensus protocols., Resilient group consensus in the presence of Byzantine agents, Resource-efficient and secure distributed state estimation over wireless sensor networks: a survey
