Knowledge state algorithms
From MaRDI portal
Publication:548658
DOI10.1007/S00453-009-9366-4zbMATH Open1223.68124OpenAlexW1991909118MaRDI QIDQ548658FDOQ548658
Wolfgang W. Bein, Rüdiger Reischuk, J. Noga, Lawrence L. Larmore
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Competitive analysis of randomized paging algorithms
- Competitive paging algorithms
- A randomized algorithm for two servers on the line.
- Beyond Competitive Analysis
- Trackless online algorithms for the server problem
- Title not available (Why is that?)
- More on randomized on-line algorithms for caching.
- Limited bookmark randomized online algorithms for the paging problem
- KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
Cited In (6)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- R-LINE: a better randomized 2-server algorithm on the line
- Engineering efficient paging algorithms
- Title not available (Why is that?)
- 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)
