On compiling algorithms for arithmetic expressions
From MaRDI portal
Publication:5535424
DOI10.1145/363534.363549zbMath0154.41901OpenAlexW1992401193WikidataQ128788414 ScholiaQ128788414MaRDI QIDQ5535424
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
Related Items (10)
On the number of registers needed to evaluate arithmetic expressions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ DNA-templated synthesis optimization ⋮ Speicheroptimale Formelübersetzung ⋮ Memory-optimal evaluation of expression trees involving large objects ⋮ The average number of registers needed to evaluate a binary tree optimally ⋮ The number of registers required for evaluating arithmetic expressions ⋮ Expression evaluation with minimum average working storage ⋮ Size-space tradeoffs for oblivious computations
This page was built for publication: On compiling algorithms for arithmetic expressions
