BibTeX record conf/stacs/SantisP91

download as .bib file

@inproceedings{DBLP:conf/stacs/SantisP91,
  author       = {Alfredo De Santis and
                  Giuseppe Persiano},
  editor       = {Christian Choffrut and
                  Matthias Jantzen},
  title        = {Tight Bounds on the Path Length of Binary Trees},
  booktitle    = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
                  Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {480},
  pages        = {478--487},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/BFb0020822},
  doi          = {10.1007/BFB0020822},
  timestamp    = {Sun, 06 Aug 2023 20:51:59 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/SantisP91.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.