Time is not a healer

DOI10.1007/BFb0028994zbMath1492.68037OpenAlexW1683896837MaRDI QIDQ5096164

Peter Widmayer, Nicola Santoro

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0028994

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (25)

Derivation of Heard-of Predicates from Elementary Behavioral Patterns ⋮ Invited talk: Resilient distributed algorithms ⋮ Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ On the radius of nonsplit graphs and information dissemination in dynamic networks ⋮ Asynchronous Byzantine reliable broadcast with a message adversary ⋮ Tight bound on mobile Byzantine agreement ⋮ Blockchain in dynamic networks ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Continuous Consensus with Failures and Recoveries ⋮ Using Bounded Model Checking to Verify Consensus Algorithms ⋮ Hundreds of impossibility results for distributed computing ⋮ On the impact of link faults on Byzantine agreement ⋮ A simple characterization of asynchronous computations ⋮ MinMax algorithms for stabilizing consensus ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ Consensus in rooted dynamic networks with short-lived stability ⋮ Synchronous consensus under hybrid process and link failures ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel ⋮ Fast Multidimensional Asymptotic and Approximate Consensus ⋮ Unnamed Item ⋮ Back to the Coordinated Attack Problem ⋮ A characterization of oblivious message adversaries for which consensus is solvable

Cites Work

• Unnamed Item
• On the possibility and impossibility of achieving clock synchronization
• Authenticated Algorithms for Byzantine Agreement
• Distributed agreement in the presence of processor and communication faults
• An upper and lower bound for clock synchronization
• The Weak Byzantine Generals Problem
• Synchronizing clocks in the presence of faults
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Dynamic fault-tolerant clock synchronization
• The Distributed Firing Squad Problem
• An efficient algorithm for byzantine agreement without authentication

This page was built for publication: Time is not a healer