A new solution for the Byzantine generals problem
From MaRDI portal
Publication:3694674
DOI10.1016/S0019-9958(85)80042-5zbMath0575.68025MaRDI QIDQ3694674
Publication date: 1985
Published in: Information and Control (Search for Journal in Brave)
complexity; deterministic algorithm; processor faults; Byzantine Agreement; communication link failures
68N25: Theory of operating systems
Related Items
Distributed computing in asynchronous networks with byzantine edges, Synchronous consensus under hybrid process and link failures, Tight bound on mobile Byzantine agreement, Efficient agreement using fault diagnosis., Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register, Approximate agreement under mobile Byzantine faults, Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps, Reliable synchronization in distributed systems