Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke. The Complexity of Paging Against a Probabilistic Adversary. In Rusins Martins Freivalds, Gregor Engels, Barbara Catania, editors, SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings. Volume 9587 of Lecture Notes in Computer Science, pages 265-276, Springer, 2016. [doi]
@inproceedings{DobrevHKKKM16, title = {The Complexity of Paging Against a Probabilistic Adversary}, author = {Stefan Dobrev and Juraj Hromkovic and Dennis Komm and Richard Královic and Rastislav Královic and Tobias Mömke}, year = {2016}, doi = {10.1007/978-3-662-49192-8_22}, url = {http://dx.doi.org/10.1007/978-3-662-49192-8_22}, researchr = {https://researchr.org/publication/DobrevHKKKM16}, cites = {0}, citedby = {0}, pages = {265-276}, booktitle = {SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings}, editor = {Rusins Martins Freivalds and Gregor Engels and Barbara Catania}, volume = {9587}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-662-49191-1}, }