scientific article; zbMATH DE number 3536107

zbMath0344.05103MaRDI QIDQ4111582

Jean Francon

Publication date: 1976

Full work available at URL: https://eudml.org/doc/92037

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Search theory (90B40) Enumeration in graph theory (05C30)

Related Items

Shuffle of parenthesis systems and Baxter permutations, Patterns in treeshelves, Alternating permutations and modified Ghandi-polynomials, Une interpretation combinatoire des coefficients des développements en série entière des fonctions elliptiques de Jacobi, Exact and asymptotic distributions in digital and binary search trees, Lyndon words, permutations and trees., Combinatorial families of multilabelled increasing trees and hook-length formulas, On the analysis of algorithms for trees, Combinatorics of faithfully balanced modules, Weakly increasing trees on a multiset, Maximal chains of subwords and up-down sequences of permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A principle of independence for binary tree searching
• Théorie géométrique des polynômes eulériens
• The Enumeration of Trees by Height and Diameter
• Efficiency of a Binary Comparison Storage Technique
• Combinatory Programming and Combinatorial Analysis
• More Combinatorial Properties of Certain Trees
• On the height of trees