Generalized Digital Trees and Their Difference—Differential Equations

DOI10.1002/RSA.3240030309MaRDI QIDQ4014641zbMATH OpenOpenAlexFDO

Authors Philippe Flajolet, Bruce Richmond

Publication date 18 October 1992

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240030309

zbMATH Keywords

random graphsMellin transformsdigital search treetree partitioning process

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

Recommendations

• A functional equation often arising in the analysis of algorithms (extended abstract)
• scientific article; zbMATH DE number 2013191
• The variance of the profile in digital search trees
• On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
• An analytic approach to the height of binary search trees. II

Cited in

(28)

• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
• Asymptotic analysis of a class of functional equations and applications
• The number of winners in a discrete geometrically distributed sample
• Hypergeometrics and the cost structure of quadtrees
• Trees and numerical methods for ordinary differential equations
• Singularity analysis, Hadamard products, and tree recurrences
• On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
• Phase transition in a generalized Eden growth model on a tree
• Analytical depoissonization and its applications
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
• Page usage in a quadtree index
• How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
• Analytic analysis of algorithms
• Toward a formal derivation of the expected behavior of prefix B-trees
• \(D\cdot E\cdot K=(100)_8\)
• A note on binomial recurrences arising in the analysis of algorithms
• scientific article; zbMATH DE number 2013191 (Why is no real title available?)
• On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
• Mellin transforms and asymptotics: Harmonic sums
• Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
• A Differential Approach for Staged Trees
• The enumeration of prudent polygons by area and its unusual asymptotics
• scientific article; zbMATH DE number 740353 (Why is no real title available?)
• Derivatives of the Pochhammer and reciprocal Pochhammer symbols and their use in epsilon-expansions of Appell and Kampé de Fériet functions
• The Wiener index of random digital trees
• Tree calculus for bivariate difference equations

This page was built for publication: Generalized Digital Trees and Their Difference—Differential Equations

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