Prosenjit Bose, Karim Douïeb. Should Static Search Trees Ever Be Unbalanced?. In Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park, editors, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. Volume 6506 of Lecture Notes in Computer Science, pages 109-120, Springer, 2010. [doi]
@inproceedings{BoseD10,
title = {Should Static Search Trees Ever Be Unbalanced?},
author = {Prosenjit Bose and Karim Douïeb},
year = {2010},
doi = {10.1007/978-3-642-17517-6_12},
url = {http://dx.doi.org/10.1007/978-3-642-17517-6_12},
tags = {search},
researchr = {https://researchr.org/publication/BoseD10},
cites = {0},
citedby = {0},
pages = {109-120},
booktitle = {Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I},
editor = {Otfried Cheong and Kyung-Yong Chwa and Kunsoo Park},
volume = {6506},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-17516-9},
}