𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple proof of a simple consensus algorithm

✍ Scribed by Jayadev Misra

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
641 KB
Volume
33
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simple proof of the uniform consensus
A simple proof of the uniform consensus synchronous lower bound
✍ Idit Keidar; Sergio Rajsbaum πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 94 KB

We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t -2, there is an execution with f failures that requires f + 2 rounds.

A simple proof for a simple rule
A simple proof for a simple rule
✍ A. MartΓ­n SΓ‘nchez; F. Vera TomΓ© πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 104 KB
A simple proof of Moser's theorem
A simple proof of Moser's theorem
✍ Zhu, Xuding πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 243 KB πŸ‘ 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.

A simple proof of Menger's theorem
A simple proof of Menger's theorem
✍ William McCuaig πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 111 KB πŸ‘ 1 views

## Abstract A proof of Menger's theorem is presented.