scientific article; zbMATH DE number 7053385

zbMath1422.68268MaRDI QIDQ5743509

Harald Räcke, Anna Adamaszek, Matthias Englert, Artur Czumaj

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095249

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

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (3)

General caching is hard: even with small pages ⋮ Breaking the 2-competitiveness barrier for two servers in a tree ⋮ Competitive clustering of stochastic communication patterns on a ring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• On-line file caching
• Page replacement with multi-size pages and applications to web caching
• New Ressults on Server Problems
• Competitive paging algorithms
• Algorithms – ESA 2005
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: