zbMATH — the first resource for mathematics

On random 2-3 trees. (English) Zbl 0369.05024

05C05 Trees
68W99 Algorithms in computer science
60C05 Combinatorial probability
Full Text: DOI
[1] Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading (Mass.): Addison-Wesley 1974 · Zbl 0326.68005
[2] Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173-189 (1972) · Zbl 0226.68008 · doi:10.1007/BF00288683
[3] Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected combinatorial research problems. Computer Science Dept., Stanford University, Problem 37, STAN-CS-72-292, 1972
[4] Knuth, D.E.: The art of computer programming, Vol. 1, Fundamental algorithms. Reading (Mass.): Addison-Wesley 1968 · Zbl 0191.17903
[5] Knuth, D.E.: The art of computer programming, Vol. 3, Sorting and searching. Reading (Mass.): Addison-Wesley 1973 · Zbl 0302.68010
[6] Yao, A. C.: On random 3-2 trees. Department of Computer Science, University of Illinois, Technical Report (74-679), October 1974
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.