✦ LIBER ✦

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

✍ Scribed by Michael Ben-Or; Dana Ron

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 540 KB
Volume: 57
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00015-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the dimensions of ordered sets of bou

On the dimensions of ordered sets of bounded degree

✍ Z. Füredi; J. Kahn 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 289 KB

Here it is proven that there exists a constant c (c < 50) such that dim P < ck(log k) \*. This improves an earlier result of Rod1 and Trotter (dim P < 2k' + 2). Our proof is nonconstructive, depending in part on LOW&Z local lemma. AMS (MOS) subject classification (1980). 06AlO.

On the formation of degree and cluster-d

On the formation of degree and cluster-degree correlations in scale-free networks

✍ Xin Yao; Chang-shui Zhang; Jin-wen Chen; Yan-da Li 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 278 KB

The cluster-degree of a vertex is the number of connections among the neighbors of this vertex. In this paper we study the cluster-degree of the generalized Baraba ´si-Albert model (GBA model) whose exponent of degree distribution ranges from 2 to 1: We present the mean-field rate equation for clust

Effective Utilization of Hypercubes in t

Effective Utilization of Hypercubes in the Presence of Faults

✍ Guanghua Lin; Nian-Feng Tzeng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

much larger than a reconfigured maximum complete subcube because the former always involves a copy of the latter plus some smaller subsystem(s). Simple and deadlock-free algorithms for routing and broadcasting messages in an incomplete hypercube have been developed [4]. A recent study on the incompl

A bound on the temporal degree of cohere

A bound on the temporal degree of coherence

✍ M.J. Bastiaans 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 231 KB

An Ω(n43) lower bound on the monotone ne

An Ω(n43) lower bound on the monotone network complexity of the nth degree convolution

✍ Norbert Blum 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 510 KB

State estimation in the presence of boun

State estimation in the presence of bounded disturbances

✍ Y. Becis-Aubry; M. Boutayeb; M. Darouach 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 461 KB

This contribution proposes a robust recursive algorithm for the state estimation of linear models with unknown but bounded disturbances corrupting both the state and measurement vectors. A novel approach based on state bounding techniques is presented. The proposed algorithm can be decomposed into t