The weighted list update problem and the lazy adversary

DOI10.1016/0304-3975(93)90201-4zbMath0779.68079OpenAlexW2005876105MaRDI QIDQ1208728

Fabrizio d'Amore, Umberto Nanni, Alberto Marchetti-Spaccamela

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90201-4

zbMATH Keywords

heuristicson-line problemlist update problemTree Update Problemweighted list update problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (3)

The list update problem and the retrieval of sets ⋮ A competitive analysis of the list update problem with lookahead ⋮ The list update problem and the retrieval of sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of diagnosis from first principles
• Competitive snoopy caching
• Two results on the list update problem
• Competitive algorithms for server problems
• Amortized Computational Complexity
• Dynamic Programming as Graph Searching: An Algebraic Approach
• Competitive paging algorithms
• On self-organizing sequential search heuristics
• Heuristics That Dynamically Organize Data Structures

This page was built for publication: The weighted list update problem and the lazy adversary