Subject
Computer Science Applications,General Mathematics,Software
Reference16 articles.
1. 1. ABRAMOWITZ M. and STEGUN I. A., Handbook of Mathematical Functions, 1965, Dover Publications.0171.38503
2. 2. BROWN G. G. and SHUBERT B. O., On Random Binary Trees, Math. Op. Res., Vol. 9, No. 1, 1984, pp. 43-65.7366380529.68035
3. 3. DEVROYE L., A Probabilistic Analysis of Height of Tries and of the Complexity of Triesort, Acta Informatica, Vol. 21, 1984, pp. 229-237.7699000555.68037
4. 4. FLAJOLET P., Approximate Counting: a Detailed Analysis, BIT, Vol. 25, 1985, pp. 113-134.7858080562.68027
5. 5. FLAJOLET P. and SEDGEWICK R., Digital Search Trees Revisited, S.I.A.M. J. Comp., Vol. 15, No. 3, 1986, pp. 748-767.8504210611.68041
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献