✦ LIBER ✦

Exponential bounds for the running time of a selection algorithm

✍ Scribed by Luc Devroye

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The worst-case running time of the rando

✍ Andrei Z. Broder; Martin E. Dyer; Alan M. Frieze; Prabhakar Raghavan; Eli Upfal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Average running time of the Boyer-Moore-

✍ Ricardo A. Baeza-Yates; Mireille Régnier 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Evaluation of the branch and bound algor

✍ Yoshihiko Hamamoto; Shunji Uchimura; Yutaka Matsuura; Taiho Kanaoka; Shingo Tomi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A branch and bound algorithm for the min

✍ P. Detti; D. Pacciarelli 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

Exponential upper and lower bounds for t

✍ Andreas Weber 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Exponential Bounds for the Uniform Devia

✍ J. Zhang; L.X. Zhu; P. Cheng 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 531 KB