✦ LIBER ✦

Tight Comparison Bounds on the Complexity of Parallel Sorting

✍ Scribed by Azar, Yossi; Vishkin, Uzi

Book ID: 118174144
Publisher: Society for Industrial and Applied Mathematics
Year: 1987
Tongue: English
Weight: 885 KB
Volume: 16
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0216032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight bounds on the complexity of the Ap

Tight bounds on the complexity of the Apostolico-Giancarlo algorithm

✍ Maxime Crochemore; Thierry Lecroq 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 678 KB

The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of $n text character comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of the

The average-case parallel complexity of

The average-case parallel complexity of sorting

✍ Ravi B. Boppana 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Tight bounds on the complexity index of

Tight bounds on the complexity index of one-point iterations

✍ J.M. Trojan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 516 KB

On the Tightness of the Alternating-Cycl

On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals

✍ Alberto Caprara 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 241 KB

Tight Bounds on the Size of Fault-Tolera

Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults

✍ Leighton, Tom; Ma, Yuan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

On the complexity of topological sorting

✍ Seinosuka Toda 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 498 KB