List update with probabilistic locality of reference

DOI10.1016/J.IPL.2012.04.002zbMath1243.68160OpenAlexW2087918687MaRDI QIDQ436596

Alejandro López-Ortiz, Reza Dorrigiv

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.002

zbMATH Keywords

analysis of algorithmsdata structureson-line algorithmslocality of referencelist update

Mathematics Subject Classification ID

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

Related Items (2)

On list update with locality of reference ⋮ On the separation and equivalence of paging strategies and other online algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Two results on the list update problem
• Randomized competitive algorithms for the list update problem
• Average case analyses of list update algorithms, with applications to data compression
• A New Perspective on List Update: Probabilistic Locality and Working Set
• List Factoring and Relative Worst Order Analysis
• On List Update with Locality of Reference
• Parameterized Analysis of Paging and List Update Algorithms
• A locally adaptive data compression scheme
• Exegesis of Self-Organizing Linear Search
• On self-organizing sequential search heuristics
• Improved Randomized On-Line Algorithms for the List Update Problem
• Beyond Competitive Analysis
• On a model for storage and search
• On Serial Files with Relocatable Records
• List Update with Locality of Reference
• Algorithms – ESA 2004

This page was built for publication: List update with probabilistic locality of reference