Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
From MaRDI portal
Publication:5326608
DOI10.1007/978-3-642-39206-1_64zbMath1336.68307OpenAlexW154532384MaRDI QIDQ5326608
Gabriel Moruz, Andrei Negoescu
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://publikationen.ub.uni-frankfurt.de/files/29674/ImprovedSpace_IRep.pdf
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
This page was built for publication: Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
