scientific article; zbMATH DE number 2013191

MaRDI QIDQ4436358zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 4 December 2003

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Random graphs (graph-theoretic aspects) (05C80) Searching and sorting (68P10) Combinatorics in computer science (68R05)

Recommendations

• Application of basic hypergeometric series.
• Generalized Digital Trees and Their Difference—Differential Equations
• Digital search trees with m trees: level polynomials and insertion costs
• A characterization of digital search trees from the successful search viewpoint
• scientific article; zbMATH DE number 3961005

Cited in

(11)

• Jump interpolation search trees and symmetric binary numbers
• Application of basic hypergeometric series.
• Binary search tree recursions with harmonic toll functions
• Search trees and Stirling numbers
• scientific article; zbMATH DE number 3961005 (Why is no real title available?)
• Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation
• scientific article; zbMATH DE number 4106282 (Why is no real title available?)
• Generalized Digital Trees and Their Difference—Differential Equations
• Digital search trees with m trees: level polynomials and insertion costs
• The expected profile of digital search trees
• Node profiles of symmetric digital search trees: Concentration properties

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436358)