Knowledge state algorithms

DOI10.1007/s00453-009-9366-4zbMath1223.68124OpenAlexW1991909118MaRDI QIDQ548658

John Noga, Lawrence L. Larmore, Wolfgang W. Bein, K. Ruediger Reischuk

Publication date: 30 June 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9366-4

zbMATH Keywords

randomizationcompetitive analysisonline algorithms

Mathematics Subject Classification ID

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

Related Items (5)

R-LINE: a better randomized 2-server algorithm on the line ⋮ A randomized algorithm for two servers in cross polytope spaces ⋮ Engineering Efficient Paging Algorithms ⋮ Unnamed Item ⋮ \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• More on randomized on-line algorithms for caching.
• Competitive analysis of randomized paging algorithms
• Trackless online algorithms for the server problem
• Limited bookmark randomized online algorithms for the paging problem
• A randomized algorithm for two servers on the line.
• KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
• Competitive paging algorithms
• Beyond Competitive Analysis
• A Randomized Algorithm for Two Servers in Cross Polytope Spaces

This page was built for publication: Knowledge state algorithms