The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Multidimensional binary search trees used for associative searching
Communications of the ACM
Graph Theory With Applications
Graph Theory With Applications
Min-max heaps and generalized priority queues
Communications of the ACM
Journal of the ACM (JACM)
Generalized selection and ranking (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
| Hi-index | 0.02 |
We consider representations of data structures in which the relative ordering of the values stored is implicit in the pattern in which the elements are retained, rather than explicit in pointers. Several implicit schemes for storing data are introduced to permit efficient implementation of the instructions insert, delete and find. &thgr;(@@@@N) basic operations are shown to be necessary and sufficient, in the worst case, to perform these instructions provided that the data elements are kept in some fixed partial order. We demonstrate, however, that further improvements can be made if an arrangement other than a fixed partial order is used. A structure, based on a fixed partial order, is introduced to facilitate multiple key searches. This structure, together with the retrieval scheme based upon it, is shown to be within a constant factor of the optimal one based on a partial order.