scientific article; zbMATH DE number 4187108

MaRDI QIDQ5751948zbMATH OpenFDO

Authors R. Schott

Publication date 1990

zbMATH Keywords

algorithms analysisalgorithms designCombinatorial techniquescontinued fractions techniquestheory of orthogonal polynomialstime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• Analytic analysis of algorithms
• Automatic average-case analysis of algorithms
• Tree enumeration and tree algorithm complexity computation
• scientific article; zbMATH DE number 4058865
• A calculus for the random generation of labelled combinatorial structures

Cited in

(9)

• Philippe Flajolet's research in analysis of algorithms and combinatorics
• Quasi-Monotonic Sequences: Theory, Algorithms and Applications
• Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
• scientific article; zbMATH DE number 4041254 (Why is no real title available?)
• scientific article; zbMATH DE number 4058865 (Why is no real title available?)
• scientific article; zbMATH DE number 2152741 (Why is no real title available?)
• scientific article; zbMATH DE number 863509 (Why is no real title available?)
• Combinatorial Analysis and Computers
• The design of efficient dynamic programming and transfer matrix enumeration 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 Q5751948)