✦ LIBER ✦

Improved upper bounds on shellsort

✍ Scribed by Janet Incerpi; Robert Sedgewick

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 835 KB
Volume: 31
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(85)90042-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound for Shellsort

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

Improved upper and lower bounds for k-br

Improved upper and lower bounds for k-broadcasting

✍ Hovhannes A. Harutyunyan; Arthur L. Liestman 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

Improved upper bounds for the atomic ion

Improved upper bounds for the atomic ionization potential

✍ J. C. Angulo; E. Romera 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB 👁 2 views

Two sets of rigorous upper bounds on the atomic ionization potential are derived from some known inequalities of the classical analysis. The first set of bounds are expressed in terms of radial expectation values of the electron density; they improve previously found bounds of the same kind and conv

Improved upper bounds for probabilities

Improved upper bounds for probabilities of uniform deviations

✍ Gábor Lugosi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Erratum: Improved upper bounds for the a

Erratum: Improved upper bounds for the atomic ionization potential

✍ J. C. Angulo; E. Romera 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 1 views

An improved upper bound on the non-3-col

An improved upper bound on the non-3-colourability threshold

✍ Paul E. Dunne; Michele Zito 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 470 KB

In this paper we derive an improved upper bound on the average vertex degree, 6. needed to ensure that: Vc > 0 and n sufficiently large, a random n-vertex graph with at least (6 + E)&! edges is almost certainly not 3-colourable. @