Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétique
RAIRO. Inform. théor., 18 4 (1984) 355-364
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Mathematics and Computer Science III
David Auber, Jean-Philippe Domenger, Maylis Delest, Philippe Duchon and Jean-Marc FédouMathematics and Computer Science III 203 (2004)
https://doi.org/10.1007/978-3-0348-7915-6_21
A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures
Markus E. NebelRandom Structures & Algorithms 21 (3-4) 252 (2002)
https://doi.org/10.1002/rsa.10052
On the Horton-Strahler number for random tries
L. Devroye and P. KruszewskiRAIRO - Theoretical Informatics and Applications 30 (5) 443 (1996)
https://doi.org/10.1051/ita/1996300504431
Fundamentals of Computation Theory
Rainer KempLecture Notes in Computer Science, Fundamentals of Computation Theory 710 329 (1993)
https://doi.org/10.1007/3-540-57163-9_28
Animaux et arbres guingois
J. Bétréma and J.G. PenaudTheoretical Computer Science 117 (1-2) 67 (1993)
https://doi.org/10.1016/0304-3975(93)90304-C
CAAP '90
Xavier Gérard ViennotLecture Notes in Computer Science, CAAP '90 431 18 (1990)
https://doi.org/10.1007/3-540-52590-4_38
A one-to-one correspondence between two classes of ordered trees
R. KempInformation Processing Letters 32 (5) 229 (1989)
https://doi.org/10.1016/0020-0190(89)90048-3
STACS 88
François Bergeron, Gilbert Labelle and Pierre LerouxLecture Notes in Computer Science, STACS 88 294 73 (1988)
https://doi.org/10.1007/BFb0035833
Annals of Discrete Mathematics (33), Proceedings of the International Conference on Finite Geometries and Combinatorial Structures
Helmut ProdingerNorth-Holland Mathematics Studies, Annals of Discrete Mathematics (33), Proceedings of the International Conference on Finite Geometries and Combinatorial Structures 144 241 (1987)
https://doi.org/10.1016/S0304-0208(08)73059-7
Brownian motion and algorithm complexity
G. LouchardBIT 26 (1) 17 (1986)
https://doi.org/10.1007/BF01939359
Combinatoire énumérative
Volker StrehlLecture Notes in Mathematics, Combinatoire énumérative 1234 294 (1986)
https://doi.org/10.1007/BFb0072522
Fundamentals of Computation Theory
Gérard ViennotLecture Notes in Computer Science, Fundamentals of Computation Theory 199 450 (1985)
https://doi.org/10.1007/BFb0028829