Geodesic
The reduction of binary trees by means of an input-restricted deque
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983) no. 3, pp. 249-284.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1983__17_3_249_0,
     author = {Kemp, R.},
     title = {The reduction of binary trees by means of an input-restricted deque},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {249--284},
     publisher = {EDP-Sciences},
     volume = {17},
     number = {3},
     year = {1983},
     mrnumber = {743889},
     zbl = {0523.68054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1983__17_3_249_0/}
}
TY  - JOUR
AU  - Kemp, R.
TI  - The reduction of binary trees by means of an input-restricted deque
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1983
SP  - 249
EP  - 284
VL  - 17
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1983__17_3_249_0/
LA  - en
ID  - ITA_1983__17_3_249_0
ER  - 
%0 Journal Article
%A Kemp, R.
%T The reduction of binary trees by means of an input-restricted deque
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1983
%P 249-284
%V 17
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1983__17_3_249_0/
%G en
%F ITA_1983__17_3_249_0
Kemp, R. The reduction of binary trees by means of an input-restricted deque. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983) no. 3, pp. 249-284. http://geodesic.mathdoc.fr/item/ITA_1983__17_3_249_0/

1. N. G. De Bruijn, D. E. Knuth and S. O. Rice, The Average Height of Planted Plane Trees, in Graph theory and Computing, R. C. READ, Ed., New York-London: Academic Press, 1972, pp. 15-22. | Zbl | MR

2. P. Flajolet and A. Odlyzko, The Average Height of Binary Trees and Other Simple Trees, J.C.S.S., Vol. 25 (2), 1982, pp. 171-213. | Zbl | MR

3. P. Flajolet, J. C. Raoult and J. Vuillemin, The Number of Registers Required for Evaluating Arithmetic Expressions, Theoret. Comp. Sc., Vol. 9, 1979, pp. 99-125. | Zbl | MR

4. R. Kemp, On the Average Stack Size of Regularly Distributed Binary Trees, in Proc. of the 6-th ICALP Conf., H. MAURER, Ed., Berlin-Heidelberg - New York, Springer, 1979, pp. 340-355. | Zbl | MR

5. R. Kemp, A Note on the Stack Size of Regularly Distributed Binary Trees, BIT, Vol. 20, 1980, pp. 157-162. | Zbl | MR

6. R. Kemp, The Average Height of R-Tuply Rooted Planted Plane Trees, Computing, Vol. 25, 1980, pp. 209-232. | Zbl | MR

7. R. Kemp, The Average Number of Registers needed to Evaluate a Binary Tree Optimally, Acta Informatica, Vol. 11, 1979, pp. 363-372. | Zbl | MR

8. D. E. Knuth, The Art of Computer Programming, Vol. 1, Reading: Addison-Wesley, 1973. | MR

9. I. Nakata, On Compiling Algorithms for Arithmetic Expressions, Comm. A.C.M., Vol. 10, 1967, pp. 492-494. | Zbl

10. R. Sethi and J. D. Ullman, The Generation of Optimal Code for Arithmetic Expressions, J.A.C.M., Vol. 17, 1970, pp. 715-728. | Zbl | MR