✦ LIBER ✦

Lower Bounds for Shellsort

✍ Scribed by C.Greg Plaxton; Torsten Suel

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 226 KB
Volume: 23
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1996.0825

No coin nor oath required. For personal study only.

✦ Synopsis

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 of Shellsort algorithms, again for arbitrary increment sequences. Our lower bounds establish an almost tight trade-off between the running time of a Shellsort algorithm and the length of the underlying increment sequence.

📜 SIMILAR VOLUMES

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Lower bounds for Seshadri constants

✍ Thomas Eckl 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract One of Demailly's characterization of Seshadri constants on ample line bundles works with Lelong numbers of certain positive singular hermitian metrics. In this note this is translated into algebraic terms by using sections of multiples of the line bundle. The resulting formula for Sesh

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.

Lower bounds for linear interval routing

✍ Eilam, T.; Moran, S.; Zaks, S. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 2 views

Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of interval routing where the routing range associated with every link is represented by an interval with no wraparound. A common way to measure the efficiency of such ro

Universal Lower Bounds for Quantum Diffu

Universal Lower Bounds for Quantum Diffusion

✍ J.M. Barbaroux; S. Tcheremchantsev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 220 KB

We study the connections between dynamical properties of Schro dinger operators H on separable Hilbert space H and the properties of corresponding spectral measures. Our main result establishes a relation for the moment of order p of the form H dt L , pÂd (T ). (1) Here L , pÂd (T ) is a function

Cramer–Rao Lower Bounds for Curve Fittin

Cramer–Rao Lower Bounds for Curve Fitting

✍ Kenichi Kanatani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 174 KB

We point out that the derivation of the Cramer-Rao lower bound for estimating a circular arc center and its radius by Chan and Thomas ( Graphical Models Image Process . 57, 1995, 527-532) has some problems although the final result is correct. Examining the mathematical structure of the problem care