✦ LIBER ✦

Improved Randomized On-Line Algorithms for the List Update Problem

✍ Scribed by Albers, Susanne

Book ID: 118177416
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 308 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539794277858

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Improved update/query algorithms for the

Improved update/query algorithms for the interval valuation problem

✍ D.S. Hirschberg; Dennis James Volper 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 301 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

An Improved Randomized On-Line Algorithm

An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem

✍ Hiroyuki Miyazawa; Thomas Erlebach 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 237 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

A randomized algorithm for the on-line w

A randomized algorithm for the on-line weighted bipartite matching problem

✍ Béla Csaba; András Pluhár 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 283 KB