✦ LIBER ✦

Fast consensus in networks of bounded degree

✍ Scribed by Piotr Berman; Juan A. Garay

Book ID: 105524759
Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 964 KB
Volume: 7
Category: Article
ISSN: 0178-2770
DOI: 10.1007/bf02280836

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost Safe Gossiping in Bounded Degree

Almost Safe Gossiping in Bounded Degree Networks

✍ Diks, Krzysztof; Pelc, Andrzej 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 874 KB

An Optimal Family of Directed, Bounded-D

An Optimal Family of Directed, Bounded-Degree Broadcast Networks

✍ Michael J. Dinneen; Nian (Alfred)Zhou 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Tolerating a Linear Number of Faults in

Tolerating a Linear Number of Faults in Networks of Bounded Degree

✍ E. Upfal 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Agreement in the presence of faults, on

Agreement in the presence of faults, on networks of bounded degree

✍ Michael Ben-Or; Dana Ron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 540 KB

On the Fault Tolerance of Some Popular B

On the Fault Tolerance of Some Popular Bounded-Degree Networks

✍ Leighton, F. Thomson; Maggs, Bruce M.; Sitaraman, Ramesh K. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 447 KB

Efficient and Scalable PRAM Algorithms f

Efficient and Scalable PRAM Algorithms for Discrete-Event Simulation of Bounded Degree Networks

✍ S. Prasad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

We describe two new parallel algorithms, one conservative and another optimistic, for discrete-event simulation on an exclusiveread exclusive-write parallel random-access machine (EREW PRAM). The target physical systems are bounded degree networks which are represented by logic circuits. Employing \