✦ LIBER ✦

A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks

✍ Scribed by C. G. Plaxton; T. Suel

Book ID: 105915334
Publisher: Springer
Year: 2000
Tongue: English
Weight: 127 KB
Volume: 33
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240010001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 computer-assisted optimal depth lower

A computer-assisted optimal depth lower bound for nine-input sorting networks

✍ Ian Parberry 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 795 KB

A Lower Bound for Network Navigability

✍ Fraigniaud, Pierre; Lebhar, Emmanuelle; Lotker, Zvi 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 341 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

Time lower bounds for parallel sorting o

Time lower bounds for parallel sorting on a mesh-connected processor array

✍ Yijie Han; Yoshihide Igarashi 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 549 KB

A Lower-Bound for the Emulation of PRAM

A Lower-Bound for the Emulation of PRAM Memories on Processor Networks

✍ T. Hagerup 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 408 KB