Tight Upper and Lower Bounds on the Path Length of Binary Trees. Santis, A. D. & Persiano, G. SIAM J. Comput., 23(1):12–23, 1994.
Tight Upper and Lower Bounds on the Path Length of Binary Trees [link]Paper  doi  bibtex   
@article{DBLP:journals/siamcomp/SantisP94,
  author       = {Alfredo De Santis and
                  Giuseppe Persiano},
  title        = {Tight Upper and Lower Bounds on the Path Length of Binary Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {23},
  number       = {1},
  pages        = {12--23},
  year         = {1994},
  url          = {https://doi.org/10.1137/S0097539791197323},
  doi          = {10.1137/S0097539791197323},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SantisP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0