✦ LIBER ✦

A parallel list update problem

✍ Scribed by F. Luccio; A. Pedrotti

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 584 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00146-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lookahead in the list update problem

✍ Rahul Simha; Amitava Majumdar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 593 KB

Off-line algorithms for the list update

Off-line algorithms for the list update problem

✍ Nick Reingold; Jeffery Westbrook 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 637 KB

Optimum off-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time 02"( n -1) !m, where n is the

A parallel two-list algorithm for the kn

A parallel two-list algorithm for the knapsack problem

✍ Der-Chyuan Lou; Chin-Chen Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

An n-element knapsack problem has 2" possible solutions to search over, so a task which can be accomplished in 2" trials if an exhaustive search is used. Due to the exponential time in solving the knapsack problem, the problem is considered to be very hard. In the past decade, much effort has been d

A combined BIT and TIMESTAMP algorithm f

A combined BIT and TIMESTAMP algorithm for the list update problem

✍ Susanne Albers; Bernhard von Stengel; Ralph Werchner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

The weighted list update problem and the

The weighted list update problem and the lazy adversary

✍ Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Analysis of a list-update strategy

✍ A. Pedrotti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 428 KB