Alternatives to splay trees with o(log n) worst-case access times (2001)

by J Iacono
Venue:In 11th Symposium on Discrete Algorithms (SODA