✦ LIBER ✦

A lower bound on strictly non-blocking networks

✍ Scribed by J. Friedman

Book ID: 105469663
Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 167 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122799

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound on Blocking Semiovals

✍ Jeremy M. Dover 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 87 KB

A semioval in a projective plane is a set S of points such that for every point P ∈ S, there exists a unique line of such that ∩ S = {P}. In other words, at every point of S, there exists a unique tangent line. A blocking set in is a set B of points such that every line of contains at least one poin

On non-blocking switching networks

✍ D. G. Cantor 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

A nonasymptotic lower time bound for a s

A nonasymptotic lower time bound for a strictly bounded second-order arithmetic

✍ Anatoly P. Beltiukov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Strictly Non-Blocking Conditions for the

Strictly Non-Blocking Conditions for the Central-Stage Buffered Clos-Network

✍ Feng Wang; Hamdi, M. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 113 KB

A lower bound on the undetected error pr

A lower bound on the undetected error probability and strictly optimal codes

✍ Abdel-Ghaffar, K.A.S. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 819 KB

On rearrangeable and non-blocking switch

On rearrangeable and non-blocking switching networks

✍ Nicholas Pippenger 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 868 KB