✦ LIBER ✦

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault-tolerant routings in double fixed-

Fault-tolerant routings in double fixed-step networks

✍ J. Fabrega; M. Zaragozà 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 770 KB

Fault-detection in networks

✍ H.F. Mattson Jr. 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 561 KB

To find broken links in networks we use the cut-set space. Information on which nodes can talk, or not, to which other nodes allows reduction of the problem to that of decoding the cut-set code of a graph. Special classes of such codes are known to have polynomial-time decoding algorithms. We prese

On fault-tolerant fixed routing in hyber

On fault-tolerant fixed routing in hybercubes

✍ Abhijit Sengupta; Suresh Viswanathan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Fault diagnosis in non-reciprocal networ

Fault diagnosis in non-reciprocal networks

✍ E. Plotkin; L. M. Roytman; M. N. S. Swamy 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB

Fault-Tolerant Broadcasting in Radio Net

Fault-Tolerant Broadcasting in Radio Networks

✍ Evangelos Kranakis; Danny Krizanc; Andrzej Pelc 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 151 KB

We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated in the plane, at grid points of a square or

Fault-tolerance in balanced sorting netw

Fault-tolerance in balanced sorting networks

✍ Jianli Sun; Jan Gecsei; Eduard Cerny 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 662 KB

Much research has been done on sorting networks but there are very few results concerning their robustness. Our starting point is the balanced sorting network introduced by Dowd et al. and its single-block robust design of Rudolph obtained at the cost of some redundancy and two permuters external to

Fault fixing network in UK