A new lower bound for the list update problem in the partial cost model

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel. A new lower bound for the list update problem in the partial cost model. Theoretical Computer Science, 268(1):3-16, 2001. [doi]

@article{AmbuhlGS01,
  title = {A new lower bound for the list update problem in the partial cost model},
  author = {Christoph Ambühl and Bernd Gärtner and Bernhard von Stengel},
  year = {2001},
  doi = {10.1016/S0304-3975(00)00257-7},
  url = {http://dx.doi.org/10.1016/S0304-3975(00)00257-7},
  researchr = {https://researchr.org/publication/AmbuhlGS01},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {268},
  number = {1},
  pages = {3-16},
}