| 1989 |
|---|
| 8 | | A. Michael Berman,
Marvin C. Paull,
Barbara G. Ryder:
Proving Relative Lower Bounds for Incremental Algorithms.
Acta Inf. 27(7): 665-683 (1989) |
| 1988 |
|---|
| 7 | EE | Barbara G. Ryder,
Marvin C. Paull:
Incremental Data-Flow Analysis.
ACM Trans. Program. Lang. Syst. 10(1): 1-50 (1988) |
| 1986 |
|---|
| 6 | EE | Barbara G. Ryder,
Marvin C. Paull:
Elimination Algorithms for Data Flow Analysis.
ACM Comput. Surv. 18(3): 277-316 (1986) |
| 1981 |
|---|
| 5 | | Thomas J. Ostrand,
Marvin C. Paull,
Elaine J. Weyuker:
Parsing Regular Grammars with Finite Lookahead.
Acta Inf. 16: 125-138 (1981) |
| 1979 |
|---|
| 4 | | Paul E. Murphy,
Marvin C. Paull:
Minimum Comparison Merging of Sets of Approximately Equal Size
Information and Control 42(1): 87-96 (1979) |
| 1968 |
|---|
| 3 | | Marvin C. Paull,
Stephen H. Unger:
Structural Equivalence and LL-k Grammars
FOCS 1968: 176-186 |
| 2 | | Marvin C. Paull,
Stephen H. Unger:
Structural Equivalence of Context-Free Grammars.
J. Comput. Syst. Sci. 2(4): 427-463 (1968) |
| 1967 |
|---|
| 1 | | Marvin C. Paull,
Stephen H. Unger:
Structural Equivalence of Context-Free Grammars
FOCS 1967: 7-13 |
