BibTeX record journals/corr/abs-1003-0139

download as .bib file

@article{DBLP:journals/corr/abs-1003-0139,
  author    = {Prosenjit Bose and
               Karim Dou{\"{\i}}eb and
               Vida Dujmovic and
               Rolf Fagerberg},
  title     = {An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case
               Access Times},
  journal   = {CoRR},
  volume    = {abs/1003.0139},
  year      = {2010},
  url       = {http://arxiv.org/abs/1003.0139},
  archivePrefix = {arXiv},
  eprint    = {1003.0139},
  timestamp = {Mon, 13 Aug 2018 16:47:49 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1003-0139.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics