"Optimal lower bounds for projective list update algorithms."

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel (2013)

> Home

Details and statistics

DOI: 10.1145/2500120

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/AmbuhlGS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/AmbuhlGS13
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal lower bounds for projective list update algorithms. ACM Trans. Algorithms 9(4): 31:1-31:18 (2013)

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.