Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Data structures and network algorithms
Data structures and network algorithms
On the single-operation worst-case time complexity of the disjoint set union problem
SIAM Journal on Computing
A lower bound on the complexity of the union-split-find problem
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
Lower bounds for the union-find and the split-find problem on pointer machines
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient motion planning for an L-shaped object
SIAM Journal on Computing
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
An improved equivalence algorithm
Communications of the ACM
An algorithm for equivalence declarations
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A simple and scalable algorithm for the IP address lookup problem
Fundamenta Informaticae - Special issue on computing patterns in strings
On the classification of dipaths in geometric models for concurrency
Mathematical Structures in Computer Science
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
A Simple and Scalable Algorithm for the IP Address Lookup Problem
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |