Right-cancellability of a family of operations on binary trees.
Duchon, Philippe (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “A semantic construction of two-ary integers”
Right-cancellability of a family of operations on binary trees.
The height of -binary search trees.
Drmota, Michael, Prodinger, Helmut (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Free dendriform algebras. I: A parenthesis setting.
Leroux, Philippe (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A simple symmetry generating operads related to rooted planar -ary trees and polygonal numbers.
Leroux, Philippe (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Descendants and ascendants in binary trees.
Panholzer, Alois, Prodinger, Helmut (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Betweenness spaces and tree algebras
Jánis Círulis (1986)
Časopis pro pěstování matematiky
Similarity:
A simple bijection between binary trees and colored ternary trees.
Sun, Yidong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: