FAQ

Binary expression tree

Known as: Expression tree 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2016
051019752016

Related topics

Related topics

9 relations
Binary treeBoolean algebraContext-free grammarParallel Tree Contraction
(More)

Related mentions per year

Related mentions per year

1938-2018
19401960198020002020
Binary expression tree
Parse tree
Tree traversal
Boolean algebra
Binary tree
Term

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Memory-optimal evaluation of expression trees involving large objects
  • 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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Complete Expression Trees for Evolving Fuzzy Classifier Systems with Genetic Algorithms and Application to Network Intrusion Detection
We propose a new linear representation scheme for evolving fuzzy rules using the concept of complete binary tree structures . We… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 4
Is this relevant?
2001
2001
Register-sensitive selection, duplication, and sequencing of instructions
In this paper, we present a new framework for <i>selecting, duplicating</i> and <i>sequencing</i> instructions so as to decrease… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
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
External-Memory Graph Algorithms
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
Dynamic expression trees and their applications
We present a technique for dynamically maintaining a collection of arithmetic expressions represented by binary trees (whose… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1991
1991
Linear-Time, Optimal Code Scheduling for Delayed-Load Architectures
A fast, optimal code scheduling algorithm for processors with a delayed lo,ad of 1 instruction cycle is described. The algorithm… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Detecting Equality of Variables in Programs
paper presents an algorithm for detecting when two computations produce equivalent values. The equivalence of programs, and hence… (More)
  • figure 3
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
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
Optimal Code Generation for Expression Trees
We discuss the problem of generating code for a wide class of machines, restricting ourselves to the computation of expression… (More)
  • figure 1
  • figure 4
Is this relevant?