✦ LIBER ✦

Lower bound for scalable Byzantine Agreement

✍ Scribed by Dan Holtby; Bruce M. Kapron; Valerie King

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 185 KB
Volume: 21
Category: Article
ISSN: 0178-2770
DOI: 10.1007/s00446-008-0069-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for Anonymous Byzan

Efficient Algorithms for Anonymous Byzantine Agreement

✍ Michael Okun; Amnon Barak 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 428 KB

A self-adjusting algorithm for byzantine

A self-adjusting algorithm for byzantine agreement

✍ Yi Zhao; Farokh B. Bastani 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 1016 KB

Connectivity requirements for Byzantine

Connectivity requirements for Byzantine agreement under restricted types of failures

✍ Vassos Hadzilacos 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 1005 KB

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Scalable and fault-tolerant key agreemen

Scalable and fault-tolerant key agreement protocol for dynamic groups

✍ A. Abdel-Hafez; A. Miri; L. Orozco-Barbosa 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

Lower Bounds for Shellsort

✍ C.Greg Plaxton; Torsten Suel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We show lower bounds on the worst-case complexity of Shellsort. In particular, Ž Ž 2 . Ž . 2 . we give a fairly simple proof of an ⍀ n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o