Generalized Digital Trees and Their Difference—Differential Equations
- 1 January 1992
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 3 (3), 305-320
- https://doi.org/10.1002/rsa.3240030309
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On some applications of formulae of Ramanujan in the analysis of algorithmsMathematika, 1991
- Analysis of the space of search trees under the random insertion algorithmJournal of Algorithms, 1989
- A diffusion limit for a class of randomly-growing binary treesProbability Theory and Related Fields, 1988
- Exact and asymptotic distributions in digital and binary search treesRAIRO - Theoretical Informatics and Applications, 1987
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- Register Allocation for Unary–Binary TreesSIAM Journal on Computing, 1986
- Periodic oscillations of coefficients of power series that satisfy functional equationsAdvances in Mathematics, 1982
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- A note on growing binary treesDiscrete Mathematics, 1973