✦ LIBER ✦

Tight lower bounds for Shellsort

✍ Scribed by Mark Allen Weiss; Robert Sedgewick

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 541 KB
Volume: 11
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(90)90005-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Shellsort

✍ C.Greg Plaxton; Torsten Suel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We show lower bounds on the worst-case complexity of Shellsort. In particular, Ž Ž 2 . Ž . 2 . we give a fairly simple proof of an ⍀ n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o

Tight lower bounds for minimum weight tr

Tight lower bounds for minimum weight triangulation heuristics

✍ Christos Levcopoulos; Drago Krznaric 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 643 KB

A new upper bound for Shellsort

✍ Robert Sedgewick 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 796 KB

A tight lower bound for the train revers

A tight lower bound for the train reversal problem

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A tight lower bound for top-down skew he

A tight lower bound for top-down skew heaps

✍ Berry Schoenmakers 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Previously, it was shown in a paper by Kaldewaij and Schoenmakers that for top-down skew heaps the amortized number of comparisons required for meld and delmin is upper bounded by log+ R, where n is the total size of the inputs to these operations and r#~ = (& + 1) /2 denotes the golden ratio. In th

Tight Lower Bounds on the Size of Sweepi

Tight Lower Bounds on the Size of Sweeping Automata

✍ Hing Leung 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB