On compiling algorithms for arithmetic expressions

DOI10.1145/363534.363549MaRDI QIDQ5535424zbMATH OpenOpenAlexWikidataFDO

Authors Ikuo Nakata

Publication date 1967

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363534.363549

zbMATH Keywords

numerical analysis

Cited in

(10)

• Size-space tradeoffs for oblivious computations
• Speicheroptimale Formelübersetzung
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• Memory-optimal evaluation of expression trees involving large objects
• Expression evaluation with minimum average working storage
• scientific article; zbMATH DE number 3829270 (Why is no real title available?)
• scientific article; zbMATH DE number 3448088 (Why is no real title available?)
• On the number of registers needed to evaluate arithmetic expressions
• DNA-templated synthesis optimization

This page was built for publication: On compiling algorithms for arithmetic expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5535424)