BibTeX record journals/corr/abs-0904-3503

download as .bib file

@article{DBLP:journals/corr/abs-0904-3503,
  author       = {Ferdinando Cicalese and
                  Eduardo Sany Laber and
                  Marco Molinaro},
  title        = {On the Complexity of Searching in Trees: Average-case Minimization},
  journal      = {CoRR},
  volume       = {abs/0904.3503},
  year         = {2009},
  url          = {http://arxiv.org/abs/0904.3503},
  eprinttype    = {arXiv},
  eprint       = {0904.3503},
  timestamp    = {Sat, 05 Mar 2022 15:53:30 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0904-3503.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.