BibTeX record conf/ictcs/JacobsenL01

download as .bib file

@inproceedings{DBLP:conf/ictcs/JacobsenL01,
  author       = {Lars Jacobsen and
                  Kim S. Larsen},
  editor       = {Antonio Restivo and
                  Simona Ronchi Della Rocca and
                  Luca Roversi},
  title        = {Complexity of Layered Binary Search Trees with Relaxed Balance},
  booktitle    = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
                  Torino, Italy, October 4-6, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2202},
  pages        = {269--284},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45446-2\_17},
  doi          = {10.1007/3-540-45446-2\_17},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/ictcs/JacobsenL01.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.