Minimizing the Number of States in Incompletely Specified Sequential Switching Functions. - Marvin C. Paull; Stephen H. Unger (IRE Trans. Electron. Comput., 1959)

A comment on a comment on pattern redundancy (Corresp.). - Marvin C. Paull (IRE Trans. Inf. Theory, 1959)

A Note on State Minimization of Asynchronous Sequential Functions. - Marvin C. Paull; Gerald Waldbaum (IEEE Trans. Electron. Comput., 1967)

Structural Equivalence and LL-k Grammars - Marvin C. Paull; Stephen H. Unger (SWAT, 1968)

Structural Equivalence of Context-Free Grammars. - Marvin C. Paull; Stephen H. Unger (J. Comput. Syst. Sci., 1968)

Minimum Comparison Merging of Sets of Approximately Equal Size - Paul E. Murphy; Marvin C. Paull (Inf. Control., 1979)

Parsing Regular Grammars with Finite Lookahead. - Thomas J. Ostrand; Marvin C. Paull; Elaine J. Weyuker (Acta Informatica, 1981)

Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. - John Franco; Marvin C. Paull (Discret. Appl. Math., 1983)

Elimination Algorithms for Data Flow Analysis. - Barbara G. Ryder; Marvin C. Paull (ACM Comput. Surv., 1986)

Conditions for incremental iteration: Examples and counterexamples. - Barbara G. Ryder; Thomas J. Marlowe; Marvin C. Paull (Sci. Comput. Program., 1988)

Incremental Data-Flow Analysis. - Barbara G. Ryder; Marvin C. Paull (ACM Trans. Program. Lang. Syst., 1988)

Least-cost partition algorithms. - Thomas J. Marlowe; Marvin C. Paull (Discret. Appl. Math., 1989)

Proving Relative Lower Bounds for Incremental Algorithms. - A. Michael Berman; Marvin C. Paull; Barbara G. Ryder (Acta Informatica, 1990)