On the Simplification and Equivalence Problems for Straight-Line Programs

Authors:
Oscar H. Ibarra;Brian S. Leininger
Affiliations:
Computer Science Department, 136 Lind Hall, Institute of Technology, University of Minnesota, Minneapolis, MN;Computer Science Department, 136 Lind Hall, Institute of Technology, University of Minnesota, Minneapolis, MN
Venue:
Journal of the ACM (JACM)
Year:
1983

The Generation of Optimal Code for Arithmetic Expressions

Journal of the ACM (JACM)
Code Generation for a One-Register Machine

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
NP-complete decision problems for quadratic polynomials

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Optimal code generation for expression trees

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference
Computation: finite and infinite machines

Computation: finite and infinite machines

Hierarchical representations with signatures for large expression management

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation

Hi-index	0.00