Christoph Ambühl

◀ ▶ joint publications with Bernhard von Stengel

> Home > Persons > Christoph Ambühl

Publications

2013
[j11]
- view
  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)
2010
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1002-2440
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1002-2440
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem. CoRR abs/1002.2440 (2010)
2001
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AmbuhlGS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AmbuhlGS01
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
A new lower bound for the list update problem in the partial cost model. Theor. Comput. Sci. 268(1): 3-16 (2001)
2000
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/AmbuhlGS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AmbuhlGS00
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316

a service of

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.