External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Complexity of Paging Against a Probabilistic Adversary

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]

Authors

Stefan Dobrev

This author has not been identified. Look up 'Stefan Dobrev' in Google

Juraj Hromkovic

This author has not been identified. Look up 'Juraj Hromkovic' in Google

Dennis Komm

This author has not been identified. Look up 'Dennis Komm' in Google

Richard Královic

This author has not been identified. Look up 'Richard Královic' in Google

Rastislav Královic

This author has not been identified. Look up 'Rastislav Královic' in Google

Tobias Mömke

This author has not been identified. Look up 'Tobias Mömke' in Google
runs on