
Search the dblp DataBase
Brian S. Leininger:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
On the Complexity of Simple Arithmetic Expressions. [Citation Graph (0, 0)][DBLP] ICALP, 1981, pp:294304 [Conf]
 Oscar H. Ibarra, Brian S. Leininger
The Complexity of the Equivalence Problem for StraightLine Programs [Citation Graph (0, 0)][DBLP] STOC, 1980, pp:273280 [Conf]
 Oscar H. Ibarra, Brian S. Leininger
On the Simplification and Equivalence Problems for StraightLine Programs [Citation Graph (0, 0)][DBLP] J. ACM, 1983, v:30, n:3, pp:641656 [Journal]
 Oscar H. Ibarra, Brian S. Leininger
On the ZeroInequivalence Problem for Loop Programs. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1983, v:26, n:1, pp:4764 [Journal]
 Oscar H. Ibarra, Brian S. Leininger, Louis E. Rosier
A Note on the Complexity of Program Evaluation. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1984, v:17, n:2, pp:8596 [Journal]
 Oscar H. Ibarra, Brian S. Leininger
Characterizations of Presburger Functions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1981, v:10, n:1, pp:2239 [Journal]
 Oscar H. Ibarra, Brian S. Leininger
StraightLine Programs with One Input Variable. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1982, v:11, n:1, pp:114 [Journal]
 Oscar H. Ibarra, Brian S. Leininger
The Complexity of the Equivalence Problem for Simple LoopFree Programs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1982, v:11, n:1, pp:1527 [Journal]
 Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
On the Complexity of Simple Arithmetic Expressions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:19, n:, pp:1728 [Journal]
Search in 0.003secs, Finished in 0.004secs
