# Brian S. Leininger

According to our database

Collaborative distances:

^{1}, Brian S. Leininger authored at least 8 papers between 1980 and 1984.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1984

A Note on the Complexity of Program Evaluation.

Mathematical Systems Theory, 1984

1983

On the Simplification and Equivalence Problems for Straight-Line Programs

J. ACM, July, 1983

On the Zero-Inequivalence Problem for Loop Programs.

J. Comput. Syst. Sci., 1983

1982

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

SIAM J. Comput., 1982

Straight-Line Programs with One Input Variable.

SIAM J. Comput., 1982

1981

Characterizations of Presburger Functions.

SIAM J. Comput., 1981

On the Complexity of Simple Arithmetic Expressions.

Proceedings of the Automata, 1981

1980

The Complexity of the Equivalence Problem for Straight-Line Programs

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