Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique

Jean Françon

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

  • Volume: 18, Issue: 4, page 355-364
  • ISSN: 0988-3754

How to cite

top

Françon, Jean. "Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.4 (1984): 355-364. <http://eudml.org/doc/92216>.

@article{Françon1984,
author = {Françon, Jean},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {number of registers required for evaluating an arithmetic expression; binary trees; recurrence relation; left height},
language = {fre},
number = {4},
pages = {355-364},
publisher = {EDP-Sciences},
title = {Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique},
url = {http://eudml.org/doc/92216},
volume = {18},
year = {1984},
}

TY - JOUR
AU - Françon, Jean
TI - Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1984
PB - EDP-Sciences
VL - 18
IS - 4
SP - 355
EP - 364
LA - fre
KW - number of registers required for evaluating an arithmetic expression; binary trees; recurrence relation; left height
UR - http://eudml.org/doc/92216
ER -

References

top
  1. 1. A. P. ERSHOV, On progamming of arithmetic operations, CACM, vol. 1, n° 8, 1958, p. 3-6. Zbl0086.33203
  2. 2. P. FLAJOLET, Combinatorial aspects of continued fractions, Discrete Math., vol. 32, 1980, p. 125-161. Zbl0445.05014MR592851
  3. 3. P. FLAJOLET, Analyses d'algorithmes de manipulation d'arbres et de fichiers, Cahiers du B.U.R.O., p. 34-35, 1981. 
  4. 4. P. FLAJOLET et J. FRANÇON, Notes non publiées. 
  5. 5. P. FLAJOLET, J. C. RAOULT et J. VUILLEMIN, The number of registers required for evaluating arithmetic expressions, Theor. Comp. Sc, vol. 9, 1979, p. 99-125. Zbl0407.68057MR535127
  6. 6. J. FRANÇON, Des codes pour arbres binaires, Actes du 2e Colloque de Lille, Les arbres en algèbre et en programmation, 17-19 février 1977. Zbl0367.94038
  7. 7. J. FRANÇON et G. VIENNOT, Permutations selon leurs pics, creux, doubles montées et doubles descentes, nombres d'Euler et nombres de Genocchi, Discrete Math., vol. 28, 1979, p. 21-35. Zbl0409.05003MR542933
  8. 8. R. E. HORTON, Erosional development of streams and their drainage basins: hydrophysical approach to quantitative morphology, Bull. of the Geological Soc. of America, vol. 56 1945, p. 275-370. 
  9. 9. R. KEMP, The average number of registers needed to evaluate a binary tree optimally, Acta Informatica, vol. 11 1979, p. 363-372. Zbl0395.68059MR533482
  10. 10. D. E. KNUTH, The Art of Computer Programming, vol. 1, Addison-Wesley, 1968. Zbl0191.17903MR378456
  11. 11. O. PERRON, Die Lehre von den Kettenbrüchen, Teubner, Leipzig und Berlin, 1929. Zbl55.0262.09JFM55.0262.09
  12. 12. R. SETHI et J. D. ULLMAN, The generation of optimal codefor arithmetic expressions, JACM, vol. 17, 1970, p. 715-728. Zbl0212.18802MR275722
  13. 13. P. S. STEVENS, Patterns in Nature, Little, Brown and Co., 1974. Traduction française : Les formes dans la nature, Seuil, Paris, 1978. 
  14. 14. A. N. STRAHLER, Hypsometric (area-altitude) analysis of erosional topology, Bull. of the Geological Soc. of America, vol. 63 1952, p. 1117-1142. 

NotesEmbed ?

top

You must be logged in to post comments.

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

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.