List Update with Locality of Reference

DOI10.1007/978-3-540-78773-0_35zbMATH Open1136.68361OpenAlexW2138719999MaRDI QIDQ5458546FDOQ5458546

Authors: Spyros Angelopoulos, Reza Dorrigiv, Alejandro Lopez-Ortiz 

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_35

Recommendations

• On List Update with Locality of Reference
• On list update with locality of reference
• List update with probabilistic locality of reference
• A new perspective on list update: probabilistic locality and working set
• Local reasoning about data update
• Data Structures with Local Update Operations
• Two results on the list update problem
• A Survey of Algorithms and Models for List Update
• Revisiting the COUNTER algorithms for list update
• A parallel list update problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On paging with locality of reference
• A combined BIT and TIMESTAMP algorithm for the list update problem
• A new measure for the study of on-line algorithms
• Algorithms – ESA 2004
• On the competitiveness of the move-to-front rule
• Title not available (Why is that?)
• Improved Randomized On-Line Algorithms for the List Update Problem
• Title not available (Why is that?)
• A Simpler Analysis of Burrows-Wheeler Based Compression

Cited In (14)

• On list update with locality of reference
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• List update with probabilistic locality of reference
• Optimal strategies for the list update problem under the MRM alternative cost model
• Stochastic dominance and the bijective ratio of online algorithms
• A new perspective on list update: probabilistic locality and working set
• Parameterized analysis of paging and list update algorithms
• Managing multiple mobile resources
• List factoring and relative worst order analysis
• On the relative dominance of paging algorithms
• A Survey of Algorithms and Models for List Update
• Local reasoning about data update
• On the separation and equivalence of paging strategies and other online algorithms
• On List Update with Locality of Reference

This page was built for publication: 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 Q5458546)