New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Self-adjusting binary search trees
Journal of the ACM (JACM)
Lower bounds for accessing binary search trees with rotations
SIAM Journal on Computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Incremental computation via function caching
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the dynamic finger conjecture for splay trees
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Anatomy of LISP
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
Incremental computation and the incremental evaluation of functional programs
Incremental computation and the incremental evaluation of functional programs
Algorithms for subset testing and finding maximal sets
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Maintaining dynamic sequences under equality-tests in polylogarithmic time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Uniquely Represented Data Structures for Computational Geometry
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
B-Treaps: A Uniquely Represented Alternative to B-Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
| Hi-index | 0.00 |