A combinatorial interpretation for certain relatives of the Conolly sequence.
Balamohan, B., Li, Zhiqiang, Tanny, Stephen (2008)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The combinatorics of certain -ary meta-Fibonacci sequences.”
A combinatorial interpretation for certain relatives of the Conolly sequence.
Trees and meta-Fibonacci sequences.
Isgur, Abraham, Reiss, David, Tanny, Stephen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Meta-Fibonacci sequences, binary trees and extremal compact codes.
Jackson, Brad, Ruskey, Frank (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Arbitrary weight changes in dynamic trees
Kurt Mehlhorn (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Similarity:
Secant tree calculus
Dominique Foata, Guo-Niu Han (2014)
Open Mathematics
Similarity:
A true Tree Calculus is being developed to make a joint study of the two statistics “eoc” (end of minimal chain) and “pom” (parent of maximum leaf) on the set of secant trees. Their joint distribution restricted to the set {eoc-pom ≤ 1} is shown to satisfy two partial difference equation systems, to be symmetric and to be expressed in the form of an explicit three-variable generating function.