An evaluation of self-adjusting binary search tree techniques

Burst tries: a fast, efficient data structure for string keys

ACM Transactions on Information Systems (TOIS)

Performance of data structures for small sets of strings

ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4

Biased Skip Lists

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

When to use splay trees

Software—Practice & Experience

Query Responsive Index Structures

GIScience '08 Proceedings of the 5th international conference on Geographic Information Science

Optimal self-adjusting trees for dynamic string data in secondary storage

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval

Reducing splaying by taking advantage of working sets

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)

Comparative performance evaluation of the AVL and red-black trees

Proceedings of the Fifth Balkan Conference in Informatics