Brian S. Leininger

According to our database, Brian S. Leininger authored at least 8 papers between 1980 and 1984.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1984

A Note on the Complexity of Program Evaluation.

Oscar H. Ibarra, Brian S. Leininger, Louis E. Rosier

Math. Syst. Theory, 1984

1983

On the Simplification and Equivalence Problems for Straight-Line Programs

Oscar H. Ibarra, Brian S. Leininger

J. ACM, July, 1983

On the Zero-Inequivalence Problem for Loop Programs.

Oscar H. Ibarra, Brian S. Leininger

J. Comput. Syst. Sci., 1983

1982

On the Complexity of Simple Arithmetic Expressions.

Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran

Theor. Comput. Sci., 1982

The Complexity of the Equivalence Problem for Simple Loop-Free Programs.

Oscar H. Ibarra, Brian S. Leininger

SIAM J. Comput., 1982

Straight-Line Programs with One Input Variable.

Oscar H. Ibarra, Brian S. Leininger

SIAM J. Comput., 1982

1981

Characterizations of Presburger Functions.

Oscar H. Ibarra, Brian S. Leininger

SIAM J. Comput., 1981

1980

The Complexity of the Equivalence Problem for Straight-Line Programs

Oscar H. Ibarra, Brian S. Leininger

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980