✦ LIBER ✦

A Lower Bound for Network Navigability

✍ Scribed by Fraigniaud, Pierre; Lebhar, Emmanuelle; Lotker, Zvi

Book ID: 118197654
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 341 KB
Volume: 24
Category: Article
ISSN: 0895-4801
DOI: 10.1137/06067626x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Merging Networks

✍ Shigeki Iwata 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 71 KB

An Improved Lower Bound for Sorting Netw

An Improved Lower Bound for Sorting Networks

✍ Van Voorhis, David C. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 345 KB

A Superlogarithmic Lower Bound for Shuff

A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks

✍ C. G. Plaxton; T. Suel 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 127 KB

A lower bound for interval routing in ge

A lower bound for interval routing in general networks

✍ Tse, Savio S. H.; Lau, Francis C. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Interval routing is a space-efficient routing method for point-to-point communication networks. The method has drawn considerable attention in recent years because of its being incorporated into the design of a commercially available routing chip. The method is based on proper labeling of edges of t

Lower bounds for approximation by MLP ne

Lower bounds for approximation by MLP neural networks

✍ Vitaly Maiorov; Allan Pinkus 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A lower bound on strictly non-blocking n

A lower bound on strictly non-blocking networks

✍ J. Friedman 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 167 KB