The Complexity of Paging Against a Probabilistic Adversary

DOI10.1007/978-3-662-49192-8_22zbMath1442.68276OpenAlexW2296517320MaRDI QIDQ2794365

Stefan Dobrev, Juraj Hromkovič, Richard Královič, Tobias Mömke, Rastislav Královič, Dennis Komm

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49192-8_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online Graph Coloring Against a Randomized Adversary ⋮ Online Matching in Regular Bipartite Graphs with Randomized Adversary

This page was built for publication: The Complexity of Paging Against a Probabilistic Adversary