Pages that link to "Item:Q3800101"
From MaRDI portal
The following pages link to Short notes: Some Properties of the Rotation Lattice of Binary Trees (Q3800101):
Displaying 20 items.
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- On the rotation distance between binary trees (Q846983) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- Weak associativity and restricted rotation (Q987810) (← links)
- Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
- A Motzkin filter in the Tamari lattice (Q2342623) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686) (← links)
- Tamari lattices and noncrossing partitions in type \(B\) (Q2433728) (← links)
- The number of coverings in four catalan lattices (Q2710772) (← links)
- On 0-rotatable trees (Q2918235) (← links)
- An algorithm to compute the möbius function of the rotation lattice of binary trees (Q3142268) (← links)
- Effective splaying with restricted rotations (Q3506250) (← links)
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions (Q4264492) (← links)
- Shellable nonpure complexes and posets. II (Q4372583) (← links)
- The higher Stasheff‐Tamari posets (Q4895411) (← links)
- An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
- The rotation \(\chi\)-lattice of ternary trees (Q5943902) (← links)
