"The Complexity of Paging Against a Probabilistic Adversary."

Stefan Dobrev et al. (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-662-49192-8_22

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/DobrevHKKKM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/DobrevHKKKM16
Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke:
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.