𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Impossibility of distributed consensus with one faulty process

✍ Scribed by Fischer, Michael J.; Lynch, Nancy A.; Paterson, Michael S.

Book ID
120918633
Publisher
Association for Computing Machinery
Year
1985
Tongue
English
Weight
709 KB
Volume
32
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Distributed algorithms for connectivity
Distributed algorithms for connectivity problem of networks with faulty elements
✍ Koichi Wada; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 919 KB

## Abstract Distributed algorithms for computing the connectivity of an asynchronous computer network with faulty computers and links are investigated. Computers which are adjacent to faulty computers and links are assumed to be capable of detecting the faults. The existence and efficiency of distr

Analysis of edge deletion processes on f
Analysis of edge deletion processes on faulty random regular graphs
✍ Andreas Goerdt; Mike Molloy πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 182 KB

Random regular graphs are, at least theoretically, popular communication networks. The reason for this is that they combine low (that is constant) degree with good expansion properties crucial for e cient communication and load balancing. When any kind of communication network gets large one is face