AVL-trees for localized search
Information and Control
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A balanced search tree with O(1) worst case update time
Acta Informatica
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Eliminating amortization: on data structures with guaranteed response time
Eliminating amortization: on data structures with guaranteed response time
A constant update time finger search tree
Information Processing Letters
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Partially persistent data structures of bounded degree with constant update time
Nordic Journal of Computing
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Purely functional data structures
Purely functional data structures
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
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
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)
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.00 |