✦ LIBER ✦

The List Update Problem: Improved Bounds for the Counter Scheme

✍ Scribed by H. Shachnai; M. Hofri

Book ID: 105746498
Publisher: Springer
Year: 1998
Tongue: English
Weight: 94 KB
Volume: 22
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009245

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Revisiting the COUNTER algorithms for li

Revisiting the COUNTER algorithms for list update

✍ Susanne Albers; Michael Mitzenmacher 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 579 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

Improved lower bounds for the cycle dete

Improved lower bounds for the cycle detection problem

✍ Eric Allender; Maria M. Klawe 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 353 KB

On the optimality of the counter scheme

On the optimality of the counter scheme for dynamic linear lists

✍ Micha Hofri; Hadas Shachmai 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 666 KB

New improved error bounds for the linear

New improved error bounds for the linear complementarity problem

✍ O. L. Mangasarian; J. Ren 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 662 KB

Improved approximation bounds for the mi

Improved approximation bounds for the minimum rainbow subgraph problem

✍ Ján Katrenič; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 145 KB