@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 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/SantisP91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"DtriH3R7psFwJHCtb","bibbaseid":"santis-persiano-tightboundsonthepathlengthofbinarytrees-1991","author_short":["Santis, A. D.","Persiano, G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Alfredo","De"],"propositions":[],"lastnames":["Santis"],"suffixes":[]},{"firstnames":["Giuseppe"],"propositions":[],"lastnames":["Persiano"],"suffixes":[]}],"editor":[{"firstnames":["Christian"],"propositions":[],"lastnames":["Choffrut"],"suffixes":[]},{"firstnames":["Matthias"],"propositions":[],"lastnames":["Jantzen"],"suffixes":[]}],"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 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/stacs/SantisP91.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/stacs/SantisP91,\n author = {Alfredo De Santis and\n Giuseppe Persiano},\n editor = {Christian Choffrut and\n Matthias Jantzen},\n title = {Tight Bounds on the Path Length of Binary Trees},\n booktitle = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer\n Science, Hamburg, Germany, February 14-16, 1991, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {480},\n pages = {478--487},\n publisher = {Springer},\n year = {1991},\n url = {https://doi.org/10.1007/BFb0020822},\n doi = {10.1007/BFB0020822},\n timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/stacs/SantisP91.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Santis, A. D.","Persiano, G."],"editor_short":["Choffrut, C.","Jantzen, M."],"key":"DBLP:conf/stacs/SantisP91","id":"DBLP:conf/stacs/SantisP91","bibbaseid":"santis-persiano-tightboundsonthepathlengthofbinarytrees-1991","role":"author","urls":{"Paper":"https://doi.org/10.1007/BFb0020822"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/p/GiuseppePersiano.bib","dataSources":["MJX3ZsyxaSJzBvjus"],"keywords":[],"search_terms":["tight","bounds","path","length","binary","trees","santis","persiano"],"title":"Tight Bounds on the Path Length of Binary Trees","year":1991}