scientific article
From MaRDI portal
Publication:3666268
zbMath0517.68051MaRDI QIDQ3666268
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reliabilitytransactionprotocolsfault-tolerant distributed computingreliable processesreplicated file systemsystem of processes
Related Items
Stopping times of distributed consensus protocols: a probabilistic analysis ⋮ Reliable broadcasts and communication models: tradeoffs and lower bounds ⋮ A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment ⋮ Message-optimal protocols for Byzantine Agreement ⋮ The Failure Discovery problem ⋮ Algorand: a secure and efficient distributed ledger ⋮ On specifications and proofs of timed circuits ⋮ Multidimensional Byzantine agreement in a synchronous setting ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Knowledge and common knowledge in a Byzantine environment: Crash failures ⋮ Unnamed Item ⋮ Hundreds of impossibility results for distributed computing ⋮ On the impact of link faults on Byzantine agreement ⋮ Randomization can be a healer: consensus with dynamic omission failures ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ On the message complexity of binary Byzantine agreement under crash failures ⋮ Space-efficient asynchronous consensus without shared memory initialization ⋮ Robust learning in social networks via matrix scaling ⋮ Revisiting the PAXOS algorithm ⋮ Using knowledge to optimally achieve coordination in distributed systems ⋮ On the complexity of computation in the presence of link failures: The case of a ring ⋮ Distributed consensus revisited ⋮ The epigenetic consensus problem
This page was built for publication:
