✦ LIBER ✦

A simple proof of the uniform consensus synchronous lower bound

✍ Scribed by Idit Keidar; Sergio Rajsbaum

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 94 KB
Volume: 85
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00333-2

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A lower-bound solution to the collapse o

A lower-bound solution to the collapse of uniform rectangular grids on simple supports

✍ M. Grigorian 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 309 KB

Lower variance bounds and a new proof of

Lower variance bounds and a new proof of the central limit theorem

✍ T Cacoullos; V Papathanasiou 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A simple proof of Liang's lower bound fo

A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case

✍ G. Galambos; J.B.G. Frenk 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 289 KB

A lower bound for the Laplacian eigenval

A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by Guo

✍ Andries E. Brouwer; Willem H. Haemers 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 97 KB

On the calculation of lower bounds: Some

On the calculation of lower bounds: Some numerical illustrations on a simple example

✍ Sven Larsson 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 629 KB

Comment on: A lower-bound solution to th

Comment on: A lower-bound solution to the collapse of uniform rectangular grids on simple supports: M. Grigorian, Int. J. mech. Sci.13, 755 (1971)

✍ K. Rajagopalan 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 116 KB