Self-adjusting binary search trees
Journal of the ACM (JACM)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Introduction to algorithms
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Randomized binary search trees
Journal of the ACM (JACM)
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Algorithms in c++, parts 1-4: fundamentals, data structure, sorting, searching, third edition
Algorithms in c++, parts 1-4: fundamentals, data structure, sorting, searching, third edition
Analytic Combinatorics
Nordic Journal of Computing
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
Skip lift: a probabilistic alternative to red-black trees
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Skip lift: A probabilistic alternative to red-black trees
Journal of Discrete Algorithms
| Hi-index | 0.00 |
This paper presents a data structure providing the usual dictionary operations, i.e. CONTAINS, INSERT, DELETE. This data structure named Jumplist is a linked list whose nodes are endowed with an additional pointer, the so-called jump pointer. Algorithms on jumplists are based on the jump-and-walk strategy: whenever possible use to the jump pointer to speed up the search, and walk along the list otherwise. The main features of jumplists are the following. They perform within a constant factor of binary search trees. Randomization makes their dynamic maintenance easy. Jumplists are a compact data structure since they provide rank-based operations and forward iterators at a cost of three pointers/integers per node. Jumplists are trivially built in linear time from sorted linked lists.