A universal online caching algorithm based on pattern matching
From MaRDI portal
Publication:848635
DOI10.1007/S00453-008-9196-9zbMATH Open1184.68652OpenAlexW1965812550MaRDI QIDQ848635FDOQ848635
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compression of individual sequences via variable-rate coding
- A universal algorithm for sequential data compression
- Title not available (Why is that?)
- Probability and Computing
- Competitive paging algorithms
- Markov Paging
- Some Distribution-Free Aspects of Paging Algorithm Performance
- Universal schemes for prediction, gambling and portfolio selection
- Universal prediction of individual sequences
- Optimal prefetching via data compression
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- Universal prediction
- Principles of Optimal Page Replacement
- A universal predictor based on pattern matching
- On sequential strategies for loss functions with memory
- Paging against a distribution and IP networking
- Can entropy characterize performance of online algorithms?
Cited In (1)
This page was built for publication: A universal online caching algorithm based on pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848635)
