Self-adjusting binary search trees
Journal of the ACM (JACM)
An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time
Journal of Computer and System Sciences
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
Dynamic optimality for skip lists and B-trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the actual time required. Distribution-sensitive data structures attempt to take advantage of underlying patterns in a sequence of operations in order to reduce time complexity, since access patterns are non-random in many applications. Many of the distribution-sensitive structures in the literature require a great deal of space overhead in the form of pointers. We present a dictionary data structure that makes use of both randomization and existing space-efficient data structures to yield low space overhead while maintaining distribution sensitivity in the expected sense. We further show a modification that allows predecessor searches in a similar time bound.