The complexity of paging against a probabilistic adversary
| Author: | Stefan Dobrev, Juraj Hromkovič, Dennis Komm, Richard Královič, Rastislav Královič, Tobias MömkeORCiDGND |
|---|---|
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/83541 |
| ISBN: | 9783662491911OPAC |
| ISBN: | 9783662491928OPAC |
| ISSN: | 0302-9743OPAC |
| ISSN: | 1611-3349OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Place of publication: | Berlin |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 2016 |
| Release Date: | 2021/02/16 |
| Volume: | 9587 |
| First Page: | 265 |
| Last Page: | 276 |
| Note: | Published in: 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. Editors: Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Catania |
| DOI: | https://doi.org/10.1007/978-3-662-49192-8_22 |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Theoretische Informatik / Resource Aware Algorithmics |
