Self-adjusting binary search trees
Journal of the ACM (JACM)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Randomized binary search trees
Journal of the ACM (JACM)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Upper Bounds for the Total Path Length of Binary Trees
Journal of the ACM (JACM)
Balancing binary trees by internal path reduction
Communications of the ACM
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Near-entropy hotlink assignments
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The longest almost-increasing subsequence
Information Processing Letters
The longest almost-increasing subsequence
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We give a deterministic version of the randomized jumplists recently introduced by Brönnimann et al. [2003]. The new structure supports searches in worst-case logarithmic time, insertions and deletions in amortized logarithmic time (versus expected logarithmic time for the randomized version), and the successor of an element can be accessed in worst-case constant time (similar to the randomized version). As for the randomized version, our deterministic counterpart does not involve duplicate indexing information or extra pointers to access the successor, in contrast with other known dictionary structures. A Jumplist is basically an ordered linked list with an extra jump pointer per node to speed up the search, using a total of two pointers and two integers per node. All dictionary operations are implemented in an easy, efficient and compact way.