On arithmetic expressions and trees-Reference-Cited by-同舟云学术

On arithmetic expressions and trees

Published:1969-02 Issue:2 Volume:12 Page:81-84
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Redziejowski R. R.¹

Affiliation:

1. IBM Nordic Lab., Lidingö, Sweden

Abstract

A description is given of how a tree representing the evaluation of an arithmetic expression can be drawn in such a way that the number of accumulators needed for the computation can be represented in a straightforward manner. This representation reduces the choice of the best order of computation to a specific problem under the theory of graphs. An algorithm to solve this problem is presented.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/362848.362859

Reference1 articles.

1. On compiling algorithms for arithmetic expressions

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Algorithm for Determining if a BST Node’s Value Can Be Changed in Place;Transactions on Computational Science and Computational Intelligence;2021

2. OptiFEX: A Framework for Exploring Area-Efficient Floating Point Expressions on FPGAs With Optimized Exponent/Mantissa Widths;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2017-01

3. Ordered Boolean List (OBL): Reducing the Footprint for Evaluating Boolean Expressions;IEEE Transactions on Visualization and Computer Graphics;2011-09

4. Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads;SIAM Journal on Computing;2001-01

5. Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;1996