On list update with locality of reference

DOI10.1016/j.jcss.2015.11.005zbMath1338.68049OpenAlexW2232872615MaRDI QIDQ269460

Sonja Lauer, Susanne Albers

Publication date: 18 April 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.11.005

zbMATH Keywords

competitive analysisonline algorithmsdata structureslocality of referenceself-organizing lists

Mathematics Subject Classification ID

Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Related Items (2)

On the separation and equivalence of paging strategies and other online algorithms ⋮ Managing multiple mobile resources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List update with probabilistic locality of reference
• A combined BIT and TIMESTAMP algorithm for the list update problem
• Two results on the list update problem
• Randomized competitive algorithms for the list update problem
• A unified analysis of paging and caching
• Average case analyses of list update algorithms, with applications to data compression
• Competitive paging with locality of reference
• Parameterized analysis of paging and list update algorithms
• A New Perspective on List Update: Probabilistic Locality and Working Set
• Self-adjusting binary search trees
• A locally adaptive data compression scheme
• On self-organizing sequential search heuristics
• On Certain New Models for Paging with Locality of Reference
• List Update with Locality of Reference
• On paging with locality of reference
• On the competitive theory and practice of online list accessing algorithms
• A new lower bound for the list update problem in the partial cost model

This page was built for publication: On list update with locality of reference