# The reduction of binary trees by means of an input-restricted deque

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1983)

- Volume: 17, Issue: 3, page 249-284
- ISSN: 0988-3754

## Access Full Article

top## How to cite

topKemp, R.. "The reduction of binary trees by means of an input-restricted deque." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 17.3 (1983): 249-284. <http://eudml.org/doc/92188>.

@article{Kemp1983,

author = {Kemp, R.},

journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},

keywords = {algorithms for the reduction of binary trees; space complexity},

language = {eng},

number = {3},

pages = {249-284},

publisher = {EDP-Sciences},

title = {The reduction of binary trees by means of an input-restricted deque},

url = {http://eudml.org/doc/92188},

volume = {17},

year = {1983},

}

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

PB - EDP-Sciences

VL - 17

IS - 3

SP - 249

EP - 284

LA - eng

KW - algorithms for the reduction of binary trees; space complexity

UR - http://eudml.org/doc/92188

ER -

## References

top- 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. Zbl0247.05106MR505710
- 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. Zbl0499.68027MR680517
- 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. Zbl0407.68057MR535127
- 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. Zbl0415.05019MR573249
- 5. R. KEMP, A Note on the Stack Size of Regularly Distributed Binary Trees, BIT, Vol. 20, 1980, pp. 157-162. Zbl0428.68076MR583031
- 6. R. KEMP, The Average Height of R-Tuply Rooted Planted Plane Trees, Computing, Vol. 25, 1980, pp. 209-232. Zbl0433.05024MR620394
- 7. R. KEMP, The Average Number of Registers needed to Evaluate a Binary Tree Optimally, Acta Informatica, Vol. 11, 1979, pp. 363-372. Zbl0395.68059MR533482
- 8. D. E. KNUTH, The Art of Computer Programming, Vol. 1, Reading: Addison-Wesley, 1973. Zbl0302.68010MR378456
- 9. I. NAKATA, On Compiling Algorithms for Arithmetic Expressions, Comm. A.C.M., Vol. 10, 1967, pp. 492-494. Zbl0154.41901
- 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. Zbl0212.18802MR275722

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.