A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Connectivity oracles for failure prone graphs
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms and theory of computation handbook
Range queries over untangled chains
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Best position algorithms for efficient top-k query processing
Information Systems
SQUISH: an online approach for GPS trajectory compression
Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Efficient algorithms for finding a longest common increasing subsequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A faster grammar-based self-index
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Journal of Network and Systems Management
The SkipTrie: low-depth concurrent search without rebalancing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We present a data structure, based upon a stratified binary tree, which enables us to manipulate on-line a priority queue whose priorities are selected from the interval 1...n, with an average and worst case processing time of O(log log n) per instruction. The structure is used to obtain a mergeable heap whose time requirements are about as good.