Generalized Digital Trees and Their Difference—Differential Equations
DOI10.1002/RSA.3240030309zbMATH Open0758.60015OpenAlexW2073792589MaRDI QIDQ4014641FDOQ4014641
Bruce Richmond, Philippe Flajolet
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
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
Characteristic functions; other transforms (60E10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)
Cites Work
Cited In (27)
- A note on binomial recurrences arising in the analysis of algorithms
- Title not available (Why is that?)
- Mellin transforms and asymptotics: Harmonic sums
- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems
- The enumeration of prudent polygons by area and its unusual asymptotics
- Asymptotic analysis of a class of functional equations and applications
- The number of winners in a discrete geometrically distributed sample
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- Phase transition in a generalized Eden growth model on a tree
- Analytical depoissonization and its applications
- \(D\cdot E\cdot K=(100)_8\)
- Trees and numerical methods for ordinary differential equations
- Toward a formal derivation of the expected behavior of prefix B-trees
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
- Title not available (Why is that?)
- The Wiener Index of Random Digital Trees
- A Differential Approach for Staged Trees
- 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
- Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
- Page usage in a quadtree index
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
- Hypergeometrics and the cost structure of quadtrees
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- Analytic analysis of algorithms
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)
