Generalized Digital Trees and Their Difference—Differential Equations

DOI10.1002/rsa.3240030309zbMath0758.60015OpenAlexW2073792589MaRDI QIDQ4014641

Bruce Richmond, Philippe Flajolet

Publication date: 18 October 1992

Published in: Random Structures and 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)

Related Items (23)

Phase transition in a generalized Eden growth model on a tree ⋮ Analytical depoissonization and its applications ⋮ Hypergeometrics and the cost structure of quadtrees ⋮ The enumeration of prudent polygons by area and its unusual asymptotics ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ Mellin transforms and asymptotics: Finite differences and Rice's integrals ⋮ Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ Page usage in a quadtree index ⋮ Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter ⋮ Derivatives of the Pochhammer and reciprocal Pochhammer symbols and their use in epsilon-expansions of Appell and Kampé de Fériet functions ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ D?E?K=(1000)8 ⋮ On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol ⋮ Analytic analysis of algorithms ⋮ How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems ⋮ The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects ⋮ Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees ⋮ The number of winners in a discrete geometrically distributed sample ⋮ Unnamed Item ⋮ On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach ⋮ The Wiener Index of Random Digital Trees ⋮ Asymptotic analysis of a class of functional equations and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

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