Generalized Digital Trees and Their Difference—Differential Equations
From MaRDI portal
Publication:4014641
DOI10.1002/rsa.3240030309zbMath0758.60015MaRDI QIDQ4014641
Philippe Flajolet, Bruce Richmond
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
60E10: Characteristic functions; other transforms
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
60C05: Combinatorial probability
Related Items
Hypergeometrics and the cost structure of quadtrees, 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, On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol, 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, Phase transition in a generalized Eden growth model on a tree, Analytical depoissonization and its applications, Page usage in a quadtree index, Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter, Asymptotic analysis of a class of functional equations and applications, On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach, Singularity analysis, Hadamard products, and tree recurrences, The number of winners in a discrete geometrically distributed sample, D?E?K=(1000)8, Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees, Unnamed Item
Cites Work
