scientific article; zbMATH DE number 4035167

MaRDI QIDQ3774965zbMATH OpenFDO

Authors Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy

Publication date 1987

zbMATH Keywords

binary treescombinatorial algorithmsfunctional-differential equationsgenerating functionspermutationssearch trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A functional equation often arising in the analysis of algorithms (extended abstract)
• Asymptotic analysis of a class of functional equations and applications
• A functional-analytical approach to the asymptotics of recursions
• scientific article; zbMATH DE number 986989
• Analytic analysis of algorithms

Cited in

(4)

• A functional equation often arising in the analysis of algorithms (extended abstract)
• Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
• A functional-analytical approach to the asymptotics of recursions
• An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms

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 Q3774965)