@article{ITA_1995__29_1_45_0, author = {Kemp, Rainer}, title = {Uniformly growing backtrack trees}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {45--73}, publisher = {EDP-Sciences}, volume = {29}, number = {1}, year = {1995}, mrnumber = {1315700}, zbl = {0889.68114}, language = {en}, url = {http://www.numdam.org/item/ITA_1995__29_1_45_0/} }
TY - JOUR AU - Kemp, Rainer TI - Uniformly growing backtrack trees JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1995 SP - 45 EP - 73 VL - 29 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1995__29_1_45_0/ LA - en ID - ITA_1995__29_1_45_0 ER -
Kemp, Rainer. Uniformly growing backtrack trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 1, pp. 45-73. http://www.numdam.org/item/ITA_1995__29_1_45_0/
1. Handbook of Mathematical Functions, Dover Publications, New York, 1970.
, ,2. Advanced Combinatorics, D. Reidel, Dordrecht-Holland/Boston-USA, 1974. | MR | Zbl
,3. Fundamentals of the Average Case Analysis of Particular Algorithms, Wiley-Teubner Series in Computer Science. Stuttgart, Teubner, Chichester, Wiley 1984. | MR | Zbl
,4. The Analysis of an Additive Weight of Random Trees, J. Inf. Process. Cybern. EIK, 1987, 23, pp. 517-528. | MR | Zbl
,5. The Expected Additive Weight of Trees, Acta Informatica, 1989, Vol. 26, pp. 711-740. | MR | Zbl
,6. Further Results on Leftist Trees, Random Graphs' 87, Wiley, 1990, pp. 103-130. | MR | Zbl
,7. On the Stack Size of a Class of Backtrack Trees, Teubner-Texte zur Informatik, Band 1, Teubner, 1992, pp. 269-282. | MR
,8. The Art of Computer Programming, Vol. 1, (2nd. ed.), Addison Wesley, Reading Mass, 1973. | MR
,9. Tree Size by Partial Backtracking, SIAM J. Comput., 1978, 7, 4, pp. 481-491. | MR | Zbl
,10. Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees, Inform. Proc. Letters, 1992, 42, pp. 67-76. | MR | Zbl
,11. On the Average Number of Registers Needed to Evaluate a Special Class of Backtrack Trees, R.A.I.R.O. Informatique théorique et Applications/Theoretical Informatics and Applications, 1993, 27, 6, pp. 541-554. | EuDML | Numdam | MR | Zbl
,