@inproceedings{conf/waoa/BrodalMN11,
  added-at = {2012-03-27T00:00:00.000+0200},
  author = {Brodal, Gerth Stølting and Moruz, Gabriel and Negoescu, Andrei},
  biburl = {http://www.bibsonomy.org/bibtex/2d6b41c90a04c26f059b6677b9a9394e7/dblp},
  booktitle = {WAOA},
  crossref = {conf/waoa/2011},
  editor = {Solis-Oba, Roberto and Persiano, Giuseppe},
  ee = {http://dx.doi.org/10.1007/978-3-642-29116-6_14},
  interhash = {b4f17704fae3c12131c39a0017dea6a0},
  intrahash = {d6b41c90a04c26f059b6677b9a9394e7},
  isbn = {978-3-642-29115-9},
  keywords = {dblp},
  pages = {164-175},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2012-03-27T00:00:00.000+0200},
  title = {OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.},
  url = {http://dblp.uni-trier.de/db/conf/waoa/waoa2011.html#BrodalMN11},
  volume = 7164,
  year = 2011
}