Marvin C. Paull

According to our database1, Marvin C. Paull
  • authored at least 14 papers between 1959 and 1990.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1990
Proving Relative Lower Bounds for Incremental Algorithms.
Acta Inf., 1990

1989
Least-cost partition algorithms.
Discrete Applied Mathematics, 1989

1988
Incremental Data-Flow Analysis.
ACM Trans. Program. Lang. Syst., 1988

Conditions for incremental iteration: Examples and counterexamples.
Sci. Comput. Program., 1988

1986
Elimination Algorithms for Data Flow Analysis.
ACM Comput. Surv., 1986

1983
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem.
Discrete Applied Mathematics, 1983

1981
Parsing Regular Grammars with Finite Lookahead.
Acta Inf., 1981

1979
Minimum Comparison Merging of Sets of Approximately Equal Size
Information and Control, July, 1979

1968
Structural Equivalence of Context-Free Grammars.
J. Comput. Syst. Sci., 1968

Structural Equivalence and LL-k Grammars
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
A Note on State Minimization of Asynchronous Sequential Functions.
IEEE Trans. Electronic Computers, 1967

Structural Equivalence of Context-Free Grammars
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1959
A comment on a comment on pattern redundancy (Corresp.).
IRE Trans. Information Theory, 1959

Minimizing the Number of States in Incompletely Specified Sequential Switching Functions.
IRE Trans. Electronic Computers, 1959


  Loading...