1984 |
9 | | Oscar H. Ibarra,
Brian S. Leininger,
Louis E. Rosier:
A Note on the Complexity of Program Evaluation.
Mathematical Systems Theory 17(2): 85-96 (1984) |
1983 |
8 | EE | Oscar H. Ibarra,
Brian S. Leininger:
On the Simplification and Equivalence Problems for Straight-Line Programs
J. ACM 30(3): 641-656 (1983) |
7 | | Oscar H. Ibarra,
Brian S. Leininger:
On the Zero-Inequivalence Problem for Loop Programs.
J. Comput. Syst. Sci. 26(1): 47-64 (1983) |
1982 |
6 | | Oscar H. Ibarra,
Brian S. Leininger:
Straight-Line Programs with One Input Variable.
SIAM J. Comput. 11(1): 1-14 (1982) |
5 | | Oscar H. Ibarra,
Brian S. Leininger:
The Complexity of the Equivalence Problem for Simple Loop-Free Programs.
SIAM J. Comput. 11(1): 15-27 (1982) |
4 | | Oscar H. Ibarra,
Brian S. Leininger,
Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions.
Theor. Comput. Sci. 19: 17-28 (1982) |
1981 |
3 | | Oscar H. Ibarra,
Brian S. Leininger,
Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions.
ICALP 1981: 294-304 |
2 | | Oscar H. Ibarra,
Brian S. Leininger:
Characterizations of Presburger Functions.
SIAM J. Comput. 10(1): 22-39 (1981) |
1980 |
1 | | Oscar H. Ibarra,
Brian S. Leininger:
The Complexity of the Equivalence Problem for Straight-Line Programs
STOC 1980: 273-280 |