The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A fast merging algorithm
Set representation and set intersection.
Set representation and set intersection.
Big Omicron and big Omega and big Theta
ACM SIGACT News
Journal of the ACM (JACM)
A unifying look at data structures
Communications of the ACM
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
| Hi-index | 0.02 |
This paper describes a data structure which is useful for representing linear lists when the pattern of accesses to a list exhibits a (perhaps time-varying) locality of reference. The structure has many of the properties of the representation proposed by Guibas, McCreight, Plass, and Roberts [4], but is substantially simpler and may be practical for lists of moderate size. The analysis of our structure includes a general treatment of the worst-case node splitting caused by consecutive insertions into a 2-3 tree.