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
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
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improving the performance of multidimensional search using fingers
Journal of Experimental Algorithmics (JEA)
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
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
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
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
| Hi-index | 0.89 |