Knowledge state algorithms

DOI10.1007/S00453-009-9366-4MaRDI QIDQ548658zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, J. Noga, Wolfgang W. Bein, Rüdiger 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

randomizationonline algorithmscompetitive analysis

Mathematics Subject Classification ID

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

Recommendations

• OnlineMin: a fast strongly competitive randomized paging algorithm
• A strongly competitive randomized paging algorithm
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• Competitive analysis of randomized paging algorithms

Cites work

• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A Randomized Algorithm for Two Servers in Cross Polytope Spaces
• A randomized algorithm for two servers on the line.
• Beyond Competitive Analysis
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
• Limited bookmark randomized online algorithms for the paging problem
• More on randomized on-line algorithms for caching.
• Trackless online algorithms for the server problem

Cited in

(6)

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• R-LINE: a better randomized 2-server algorithm on the line
• Engineering efficient paging algorithms
• KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
• A randomized algorithm for two servers in cross polytope spaces

This page was built for publication: Knowledge state algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548658)