Harry R. Lewis
Affiliations: | Computer Science | Harvard University, Cambridge, MA, United States |
Website:
http://www.seas.harvard.edu/node/22528Google:
"Harry R. Lewis"Bio:
http://www.genealogy.math.ndsu.nodak.edu/id.php?id=87927
Parents
Sign in to add mentor| Burton S. Dreben | grad student | 1974 | Harvard (Philosophy Tree) | |
| (Herbrand Expansions and Reductions of the Decision Problem) | ||||
Children
Sign in to add trainee| John H. Reif | grad student | 1977 | Harvard |
| W Randolph Franklin | grad student | 1978 | Harvard |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Reif JH, Lewis HR. (1986) Efficient symbolic analysis of programs Journal of Computer and System Sciences. 32: 280-314 |
| Gurevich Y, Lewis HR. (1984) The Word Problem for Cancellation Semigroups with Zero Journal of Symbolic Logic. 49: 184-191 |
| Gurevich Y, Lewis HR. (1984) A logic for constant-depth circuits Information and Control. 61: 65-74 |
| Denenberg L, Lewis HR. (1984) The complexity of the satisfiability problem for Krom formulas Theoretical Computer Science. 30: 319-341 |
| Aanderaa SO, Börger E, Lewis HR. (1982) Conservative Reduction Classes of Krom Formulas Journal of Symbolic Logic. 47: 110-130 |
| Gurevich Y, Lewis HR. (1982) The inference problem for template dependencies Information and Control. 55: 69-79 |
| Lewis HR, Papadimitriou CH. (1982) Symmetric space-bounded computation Theoretical Computer Science. 19: 161-187 |
| Lewis HR. (1980) Complexity results for classes of quantificational formulas Journal of Computer and System Sciences. 21: 317-353 |
| Lewis HR. (1979) Satisfiability problems for propositional calculi Mathematical Systems Theory. 13: 45-53 |
| Lewis HR. (1976) Krom formulas with one dyadic predicate letter Journal of Symbolic Logic. 41: 341-362 |