Rotation distance, triangulations, and hyperbolic geometry

Authors:
D D Sleator;R E Tarjan;W P Thurston
Affiliations:
Computer Science Department, Carnegie-Mellon University, Pittsbtirgh, PA;Computer Science Department, Princeton University, Princeton, NJ and AT&T Bell Laboratories, Murray Hill, NJ;Mathematics Department, Princeton University, Princeton, NJ
Venue:
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Year:
1986

Data structures and network algorithms

Data structures and network algorithms
Self-adjusting binary search trees

Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

On the dynamic finger conjecture for splay trees

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Tetrahedrizing point sets in three dimensions

Journal of Symbolic Computation
Morphing simple polygons

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On optimal piggyback merging policies for video-on-demand systems

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
O(log log n)-competitive dynamic binary search trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The geometry of binary search trees

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Combining binary search trees

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Hi-index	0.00