The combinatorics of certain -ary meta-Fibonacci sequences.
Ruskey, Frank, Deugau, Chris (2009)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Trees and meta-Fibonacci sequences.”
The combinatorics of certain -ary meta-Fibonacci sequences.
A combinatorial interpretation for certain relatives of the Conolly sequence.
Balamohan, B., Li, Zhiqiang, Tanny, Stephen (2008)
Journal of Integer Sequences [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:
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:
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
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:
Arbitrary weight changes in dynamic trees
Kurt Mehlhorn (1981)
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:
Skip trees, an alternative data structure to skip lists in a concurrent approach
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: