%0 Conference Paper %1 conf/ictcs/JacobsenL01 %A Jacobsen, Lars %A Larsen, Kim S. %B ICTCS %D 2001 %E Restivo, Antonio %E Rocca, Simona Ronchi Della %E Roversi, Luca %I Springer %K dblp %P 269-284 %T Complexity of Layered Binary Search Trees with Relaxed Balance. %U http://dblp.uni-trier.de/db/conf/ictcs/ictcs2001.html#JacobsenL01 %V 2202 %@ 3-540-42672-8

@inproceedings{conf/ictcs/JacobsenL01, added-at = {2017-05-21T00:00:00.000+0200}, author = {Jacobsen, Lars and Larsen, Kim S.}, biburl = {https://www.bibsonomy.org/bibtex/2ee4d35b799f4a5fe73eda7ddc9632fd6/dblp}, booktitle = {ICTCS}, crossref = {conf/ictcs/2001}, editor = {Restivo, Antonio and Rocca, Simona Ronchi Della and Roversi, Luca}, ee = {https://doi.org/10.1007/3-540-45446-2_17}, interhash = {ecd8871a04411a9e552658b346b874ac}, intrahash = {ee4d35b799f4a5fe73eda7ddc9632fd6}, isbn = {3-540-42672-8}, keywords = {dblp}, pages = {269-284}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:37:59.000+0200}, title = {Complexity of Layered Binary Search Trees with Relaxed Balance.}, url = {http://dblp.uni-trier.de/db/conf/ictcs/ictcs2001.html#JacobsenL01}, volume = 2202, year = 2001 }