On list update with locality of reference

DOI10.1016/J.JCSS.2015.11.005MaRDI QIDQ269460zbMATH OpenOpenAlexFDO

Authors 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

online algorithmsdata structurescompetitive analysislocality of referenceself-organizing lists

Mathematics Subject Classification ID

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

Recommendations

• On List Update with Locality of Reference
• List Update with Locality of Reference
• List update with probabilistic locality of reference
• A new perspective on list update: probabilistic locality and working set
• A Survey of Algorithms and Models for List Update

Cites work

• scientific article; zbMATH DE number 1670645 (Why is no real title available?)
• scientific article; zbMATH DE number 1256656 (Why is no real title available?)
• scientific article; zbMATH DE number 1263239 (Why is no real title available?)
• scientific article; zbMATH DE number 910910 (Why is no real title available?)
• scientific article; zbMATH DE number 6472578 (Why is no real title available?)
• A combined BIT and TIMESTAMP algorithm for the list update problem
• A locally adaptive data compression scheme
• A new lower bound for the list update problem in the partial cost model
• A new perspective on list update: probabilistic locality and working set
• 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
• List Update with Locality of Reference
• List update with probabilistic locality of reference
• On Certain New Models for Paging with Locality of Reference
• On paging with locality of reference
• On self-organizing sequential search heuristics
• On the competitive theory and practice of online list accessing algorithms
• On the separation and equivalence of paging strategies
• Parameterized analysis of paging and list update algorithms
• Randomized competitive algorithms for the list update problem
• Self-adjusting binary search trees
• Two results on the list update problem

Cited in

(11)

• List update with probabilistic locality of reference
• List Update with Locality of Reference
• Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference
• The itinerant list update problem
• A new perspective on list update: probabilistic locality and working set
• Managing multiple mobile resources
• scientific article; zbMATH DE number 1947389 (Why is no real title available?)
• On the separation and equivalence of paging strategies and other online algorithms
• Local reasoning about data update
• On List Update with Locality of Reference
• Analysis and experimentation on list update algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269460)