How to Splay for loglog N-Competitiveness

George F. Georgakopoulos. How to Splay for loglog N-Competitiveness. In Sotiris E. Nikoletseas, editor, Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings. Volume 3503 of Lecture Notes in Computer Science, pages 570-579, Springer, 2005. [doi]

@inproceedings{Georgakopoulos05,
  title = {How to Splay for loglog N-Competitiveness},
  author = {George F. Georgakopoulos},
  year = {2005},
  doi = {10.1007/11427186_49},
  url = {http://dx.doi.org/10.1007/11427186_49},
  researchr = {https://researchr.org/publication/Georgakopoulos05},
  cites = {0},
  citedby = {0},
  pages = {570-579},
  booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings},
  editor = {Sotiris E. Nikoletseas},
  volume = {3503},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25920-1},
}