✦ LIBER ✦

On the average-case complexity of “bucketing” algorithms

✍ Scribed by Selim G Akl; Henk Meijer

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 203 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90003-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The average-case parallel complexity of

The average-case parallel complexity of sorting

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

Drift analysis and average time complexi

Drift analysis and average time complexity of evolutionary algorithms

✍ Jun He; Xin Yao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 212 KB

The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including cond

Complexity of multilinear problems in th

Complexity of multilinear problems in the average case setting

✍ Tomasz Jackowski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 960 KB

How to reduce the average complexity of

How to reduce the average complexity of convex hull finding algorithms

✍ Luc Devroye 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 640 KB

Average-case scalable on-line algorithms

Average-case scalable on-line algorithms for fault replacement

✍ Kirk R. Pruhs 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB

Average case complexity of elliptic part

Average case complexity of elliptic partial differential equations

✍ Arthur G Werschulz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 922 KB