✦ LIBER ✦

Two results on the list update problem

✍ Scribed by Sandy Irani

Book ID: 107765956
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 701 KB
Volume: 38
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90086-w

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

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

The List Update Problem: Improved Bounds

The List Update Problem: Improved Bounds for the Counter Scheme

✍ H. Shachnai; M. Hofri 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 94 KB

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

An update on the middle levels problem

✍ Ian Shields; Brendan J. Shields; Carla D. Savage 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 676 KB