Equitable Revisited

DOI10.1007/978-3-540-75520-3_38MaRDI QIDQ3527231zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, J. Noga, Wolfgang W. Bein

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_38

zbMATH Keywords

design of algorithmsonline algorithmspagingrandomization

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Improved space bounds for strongly competitive randomized paging algorithms
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• Competitive analysis of randomized paging algorithms
• OnlineMin: a fast strongly competitive randomized paging algorithm

Cited in

(6)

• Randomized competitive analysis for two server problems
• Equivalent LLTMS: a rejoinder
• Online file caching with rejection penalties
• Randomized Competitive Analysis for Two-Server Problems
• A Randomized Algorithm for Two Servers in Cross Polytope Spaces
• A randomized algorithm for two servers in cross polytope spaces

This page was built for publication: Equitable Revisited

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