Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Persistence, amortization and randomization
SODA '91 Proceedings of the second 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
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal finger search trees in the pointer machine
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Time and Space Efficient Multi-method Dispatching
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
An Experimental Evaluation of Hybrid Data Structures for Searching
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The randomized complexity of maintaining the minimum
Nordic Journal of Computing
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
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Multidimensional heaps and complementary range searching
Information Processing Letters
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
An experimental performance comparison for indexing mobile objects on the plane
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Indexing mobile objects on the plane revisited
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Algorithms and theory of computation handbook
Skip lift: a probabilistic alternative to red-black trees
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
Skip lift: A probabilistic alternative to red-black trees
Journal of Discrete Algorithms
| Hi-index | 0.00 |