Marvin C. Paull

Publication Activity (10 Years)

Years Active: 1959-1990
Publications (10 Years): 0

Publications

A. Michael Berman, Marvin C. Paull, Barbara G. Ryder
Proving Relative Lower Bounds for Incremental Algorithms. Acta Informatica 27 (7) (1990)
Thomas J. Marlowe, Marvin C. Paull
Least-cost partition algorithms. Discret. Appl. Math. 22 (3) (1989)
Barbara G. Ryder, Thomas J. Marlowe, Marvin C. Paull
Conditions for incremental iteration: Examples and counterexamples. Sci. Comput. Program. 11 (1) (1988)
Barbara G. Ryder, Marvin C. Paull
Incremental Data-Flow Analysis. ACM Trans. Program. Lang. Syst. 10 (1) (1988)
Barbara G. Ryder, Marvin C. Paull
Elimination Algorithms for Data Flow Analysis. ACM Comput. Surv. 18 (3) (1986)
John Franco, Marvin C. Paull
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discret. Appl. Math. 5 (1) (1983)
Thomas J. Ostrand, Marvin C. Paull, Elaine J. Weyuker
Parsing Regular Grammars with Finite Lookahead. Acta Informatica 16 (1981)
Paul E. Murphy, Marvin C. Paull
Minimum Comparison Merging of Sets of Approximately Equal Size Inf. Control. 42 (1) (1979)
Marvin C. Paull, Stephen H. Unger
Structural Equivalence and LL-k Grammars SWAT (1968)
Marvin C. Paull, Stephen H. Unger
Structural Equivalence of Context-Free Grammars. J. Comput. Syst. Sci. 2 (4) (1968)
Marvin C. Paull, Stephen H. Unger
Structural Equivalence of Context-Free Grammars SWAT (1967)
Marvin C. Paull, Gerald Waldbaum
A Note on State Minimization of Asynchronous Sequential Functions. IEEE Trans. Electron. Comput. 16 (1) (1967)
Marvin C. Paull
A comment on a comment on pattern redundancy (Corresp.). IRE Trans. Inf. Theory 5 (1) (1959)
Marvin C. Paull, Stephen H. Unger
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions. IRE Trans. Electron. Comput. 8 (3) (1959)