A universal online caching algorithm based on pattern matching

DOI10.1007/s00453-008-9196-9zbMath1184.68652OpenAlexW1965812550MaRDI QIDQ848635

Wojciech Szpankowski, Gopal Pandurangan

Publication date: 4 March 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9196-9

zbMATH Keywords

CachingOnline computationStochastic modelUniversal algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal schemes for prediction, gambling and portfolio selection
• Paging against a distribution and IP networking
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Competitive paging algorithms
• Universal prediction of individual sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Algorithms on Strings, Trees and Sequences
• Optimal prefetching via data compression
• Markov Paging
• A universal predictor based on pattern matching
• On sequential strategies for loss functions with memory
• Universal prediction
• Probability and Computing
• Principles of Optimal Page Replacement

This page was built for publication: A universal online caching algorithm based on pattern matching