%0 Journal Article %1 journals/mst/BrodalMN15 %A Brodal, Gerth Stølting %A Moruz, Gabriel %A Negoescu, Andrei %D 2015 %J Theory Comput. Syst. %K dblp %N 1 %P 22-40 %T OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. %U http://dblp.uni-trier.de/db/journals/mst/mst56.html#BrodalMN15 %V 56

@article{journals/mst/BrodalMN15, added-at = {2019-10-19T00:00:00.000+0200}, author = {Brodal, Gerth Stølting and Moruz, Gabriel and Negoescu, Andrei}, biburl = {https://www.bibsonomy.org/bibtex/264d78cf83af906ece9039a4f8eca7dd2/dblp}, ee = {https://doi.org/10.1007/s00224-012-9427-y}, interhash = {d568a9d3195410dc12b2607843a16d97}, intrahash = {64d78cf83af906ece9039a4f8eca7dd2}, journal = {Theory Comput. Syst.}, keywords = {dblp}, number = 1, pages = {22-40}, timestamp = {2019-10-22T12:39:14.000+0200}, title = {OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.}, url = {http://dblp.uni-trier.de/db/journals/mst/mst56.html#BrodalMN15}, volume = 56, year = 2015 }