Randomized competitive algorithms for generalized caching

Nikhil Bansal, Niv Buchbinder, Joseph Naor. Randomized competitive algorithms for generalized caching. In Richard E. Ladner, Cynthia Dwork, editors, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. pages 235-244, ACM, 2008. [doi]

@inproceedings{BansalBN08,
  title = {Randomized competitive algorithms for generalized caching},
  author = {Nikhil Bansal and Niv Buchbinder and Joseph Naor},
  year = {2008},
  doi = {10.1145/1374376.1374412},
  url = {http://doi.acm.org/10.1145/1374376.1374412},
  tags = {caching},
  researchr = {https://researchr.org/publication/BansalBN08},
  cites = {0},
  citedby = {0},
  pages = {235-244},
  booktitle = {Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008},
  editor = {Richard E. Ladner and Cynthia Dwork},
  publisher = {ACM},
  isbn = {978-1-60558-047-0},
}