Balanced search trees made simple (1993)
by
Arne Andersson
| Venue: | In Proc. 3rd Workshop on Algorithms and Data Structures |
| Citations: | 16 - 0 self |
BibTeX
@INPROCEEDINGS{Andersson93balancedsearch,
author = {Arne Andersson},
title = {Balanced search trees made simple},
booktitle = {In Proc. 3rd Workshop on Algorithms and Data Structures},
year = {1993},
pages = {60--71},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenance algorithms for balanced trees. In terms of code simplicity, our algorithms compare favourably with those for deterministic and probabilistic skip lists.
