A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expressionâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Chi-Chung Lama, Thomas Rauberb, Gerald Baumgartnerc, Daniel Cociorvaa, P. Sadayappana
- 2010

The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronicâ€¦Â (More)

Is this relevant?

2002

2002

We propose a new linear representation scheme for evolving fuzzy rules using the concept of complete binary tree structures . Weâ€¦Â (More)

Is this relevant?

2001

2001

In this paper, we present a new framework for <i>selecting, duplicating</i> and <i>sequencing</i> instructions so as to decreaseâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Edson CÃ¡ceres, Frank Dehne, +5 authors Siang Wun Song
- Algorithmica
- 1997

In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronousâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
- SODA
- 1995

Michael T. GoodrichjS Edward F. Grovefll Roberto Tamassia*t Darren Erik Vengrofftt Jeffrey Scott Vitterqt We present a collectionâ€¦Â (More)

Is this relevant?

1991

1991

- Robert F. Cohen, Roberto Tamassia
- SODA '91
- 1991

We present a technique for dynamically maintaining a collection of arithmetic expressions represented by binary trees (whoseâ€¦Â (More)

Is this relevant?

1991

1991

- Todd A. Proebsting, Charles N. Fischer
- PLDI
- 1991

A fast, optimal code scheduling algorithm for processors with a delayed lo,ad of 1 instruction cycle is described. The algorithmâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck
- POPL
- 1988

paper presents an algorithm for detecting when two computations produce equivalent values. The equivalence of programs, and henceâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Richard Cole, Uzi Vishkin
- Algorithmica
- 1988

A new general parallel algorithmic technique for computations on trees is presented. In particular, it provides the firstn/lognâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Alfred V. Aho, Stephen C. Johnson
- STOC
- 1975

We discuss the problem of generating code for a wide class of machines, restricting ourselves to the computation of expressionâ€¦Â (More)

Is this relevant?