Marvin C. Paull

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