New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A New Data Structure for Representing Sorted Lists
WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Self-adjusting binary search trees
Journal of the ACM (JACM)
A locally adaptive data compression scheme
Communications of the ACM
Planar point location using persistent search trees
Communications of the ACM
Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Fully persistent lists with catenation
Journal of the ACM (JACM)
Purely functional random-access lists
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An optimal RAM implementation of catenable min double-ended queues
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal finger search trees in the pointer machine
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences - STOC 2002
New dynamic balanced search trees with worst-case constant update time
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Improving the performance of multidimensional search using fingers
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.03 |
It is well known that every one of the set operations insert, delete and member can be performed in O(log n) steps, where n is the number of elements currently in the set. Here we implement these operations and a move operation for a sorted list with f fingers (points of reference) established on the list. It is shown that these operations can be performed in O(log d) steps, where d is the distance between the corresponding finger and the key involved.