This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Literaturhinweise
A.V. Aho and S.C. Johnson “Optimal code generation for expression trees”, JACM 23, 3 (July 1976)
A.V. Aho, S.C. Johnson and J.D. Ullman “Code generation for expressions with common subexpressions”, JACM 24, 1 (Jan. 1977)
A.V. Aho and R. Sethi “How hard is compiler code generation”, Lecture Notes in Computer Science 52 (1977)
J. Bruno and R. Sethi “Code generation for a one-register machine”, JACM 23, 3 (July 1976)
B. Prabhala and R. Sethi “Efficient computation of expressions with common subexpressions”, V. ACM Symp. on POPL (Jan. 1978)
R. Sethi and J.D. Ullman “The generation of optimal code for arithmetic expressions”, JACM 17, 4 (Oct. 1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Güttler, R. (1981). Erzeugung optimalen Codes für Series — Parallel Graphs. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017303
Download citation
DOI: https://doi.org/10.1007/BFb0017303
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive