no. 6
On the average number of registers needed to evaluate a special class of backtrack trees
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 6, pp. 541-554 
@article{ITA_1993__27_6_541_0,
     author = {Trier, U.},
     title = {On the average number of registers needed to evaluate a special class of backtrack trees},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {541--554},
     year = {1993},
     publisher = {EDP Sciences},
     volume = {27},
     number = {6},
     mrnumber = {1258751},
     zbl = {0809.68104},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1993__27_6_541_0/}
}
TY  - JOUR
AU  - Trier, U.
TI  - On the average number of registers needed to evaluate a special class of backtrack trees
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1993
SP  - 541
EP  - 554
VL  - 27
IS  - 6
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1993__27_6_541_0/
LA  - en
ID  - ITA_1993__27_6_541_0
ER  - 
%0 Journal Article
%A Trier, U.
%T On the average number of registers needed to evaluate a special class of backtrack trees
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1993
%P 541-554
%V 27
%N 6
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1993__27_6_541_0/
%G en
%F ITA_1993__27_6_541_0
Trier, U. On the average number of registers needed to evaluate a special class of backtrack trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 6, pp. 541-554. https://www.numdam.org/item/ITA_1993__27_6_541_0/

1. Ph. Flajolet, J.-C. Raoult and J. Vuillemin, The Number of Registers Required to Evaluate Arithmetic Expressions, Theoret. Comp. Sci. 1979, 9, pp. 99-125. | Zbl | MR

2. R. L. Graham, D. E. Knuth and O. Patashnik, ConcreteMathematics, Addison-Wesley, Reading, Mass. 1988. | Zbl

3. R. Kemp, The Average Number of Registers Needed to Evaluate a Binary Tree Optimally, Acta Inf., 1979, 11, pp. 363-372. | Zbl | MR

4. R. Kemp, The Expected Additive Weight of Trees, Acta Inf., 1989, 26, pp. 7-740. | Zbl | MR

5. R. Kemp, The Analysis of a Special Class of Backtrack Trees, preprint Johann Wolfgang Goethe-Universität Frankfurt, 1991.

6. R. Kemp, On the Stacksize of a Class of Backtrack Trees, preprint Johann Wolfgang Goethe-Universität Frankfurt, 1991.

7. D. E. Knuth, The Art of Computer Programming, Vol. 1, (2nd éd.), Addison-Wesley, Reading, Mass., 1973. | MR

8. A. Meir and J. W. Moon, On the Altitude of Nodes in Random Trees, Can. J. Math., 1978, 30 pp. 997-1015. | Zbl | MR

9. H. Prodinger, Détermination de certains paramètres d'arbres binaires à l'aide de méthodes analytiques, Laboratoire de Recherche en Informatique, Université Paris 11, 91405 Orsay cedex-France, Rapport de Recherche N° 177, 1984.

10. P. W. Purdom, Tree Size by Partial Backtracking, SIAM J. Comput., 1978, 7 (4) pp. 481-491. | Zbl | MR

11. U. Trier, Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees, Inform. Proc. Letters, 1992, 42, pp. 67-76. | Zbl | MR