The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marvin C. Paull: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002