Recommendations
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)
