A shortest path metric on unlabeled binary trees
Pattern Recognition Letters
Finite pseudocomplemented lattices
European Journal of Combinatorics
Restricted rotation distance between binary trees
Information Processing Letters
Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
Right-arm rotation distance between binary trees
Information Processing Letters
k-Restricted rotation distance between binary trees
Information Processing Letters
Rotational tree structures on binary trees and triangulations
Acta Cybernetica
Effective splaying with restricted rotations
International Journal of Computer Mathematics
k-Restricted rotation with an application to search tree rebalancing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Root-restricted Kleenean rotations
Information Processing Letters
| Hi-index | 0.89 |
A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.