scientific article; zbMATH DE number 7559165

DOI10.4230/LIPIcs.STACS.2019.56MaRDI QIDQ5090507

Enoch Peserico

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1304.6007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

energycacheelasticonlinepagingadaptivecompetitivevirtual

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of performance measures for online algorithms
• Competitive snoopy caching
• A new measure for the study of on-line algorithms
• Page replacement with multi-size pages and applications to web caching
• Competitive paging with locality of reference
• Minimizing Cache Usage in Paging
• Efficient On-Line Call Control Algorithms
• Cache-Oblivious Algorithms
• Competitive paging algorithms
• Beyond Competitive Analysis
• LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies
• Cache-Adaptive Algorithms
• On paging with locality of reference

This page was built for publication: