| 1990 |
|---|
| 27 | | Harry R. Lewis:
A Logic of Concrete Time Intervals (Extended Abstract)
LICS 1990: 380-389 |
| 1986 |
|---|
| 26 | | John H. Reif,
Harry R. Lewis:
Efficient Symbolic Analysis of Programs.
J. Comput. Syst. Sci. 32(3): 280-314 (1986) |
| 1984 |
|---|
| 25 | | Yuri Gurevich,
Harry R. Lewis:
A Logic for Constant-Depth Circuits
Information and Control 61(1): 65-74 (1984) |
| 24 | | Yuri Gurevich,
Harry R. Lewis:
The Word Problem for Cancellation Semigroups with Zero.
J. Symb. Log. 49(1): 184-191 (1984) |
| 23 | | Larry Denenberg,
Harry R. Lewis:
The Complexity of the Satisfiability Problem for Krom Formulas.
Theor. Comput. Sci. 30: 319-341 (1984) |
| 1982 |
|---|
| 22 | EE | Yuri Gurevich,
Harry R. Lewis:
The Inference Problem for Template Dependencies.
PODS 1982: 221-229 |
| 21 | | Harry R. Lewis,
Richard Statman:
Unifiability is Complete for co-NLogSpace.
Inf. Process. Lett. 15(5): 220-222 (1982) |
| 20 | | Yuri Gurevich,
Harry R. Lewis:
The Inference Problem for Template Dependencies
Information and Control 55(1-3): 69-79 (1982) |
| 19 | | Stål Aanderaa,
Egon Börger,
Harry R. Lewis:
Conservative Reduction Classes of Krom Formulas.
J. Symb. Log. 47(1): 110-130 (1982) |
| 18 | | Harry R. Lewis,
Christos H. Papadimitriou:
Symmetric Space-Bounded Computation.
Theor. Comput. Sci. 19: 161-187 (1982) |
| 1981 |
|---|
| 17 | | Harry R. Lewis,
Christos H. Papadimitriou:
Elements of the Theory of Computation
Prentice-Hall 1981 |
| 16 | | Ashok K. Chandra,
Harry R. Lewis,
Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem
STOC 1981: 342-354 |
| 1980 |
|---|
| 15 | | Harry R. Lewis,
Christos H. Papadimitriou:
Symmetric Space-Bounded Computation (Extended Abstract).
ICALP 1980: 374-384 |
| 14 | | Ashok K. Chandra,
Harry R. Lewis,
Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem.
XP1 Workshop on Database Theory 1980 |
| 13 | | Harry R. Lewis:
Complexity Results for Classes of Quantificational Formulas.
J. Comput. Syst. Sci. 21(3): 317-353 (1980) |
| 1979 |
|---|
| 12 | | Harry R. Lewis:
Satisfiability Problems for Propositional Calculi.
Mathematical Systems Theory 13: 45-53 (1979) |
| 1978 |
|---|
| 11 | | Harry R. Lewis:
Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus
FOCS 1978: 35-47 |
| 10 | EE | Harry R. Lewis:
Renaming a Set of Clauses as a Horn Set.
J. ACM 25(1): 134-135 (1978) |
| 1977 |
|---|
| 9 | | Harry R. Lewis:
A New Decidable Problem, with Applications (Extended Abstract)
FOCS 1977: 62-73 |
| 8 | | John H. Reif,
Harry R. Lewis:
Symbolic Evaluation and the Global Value Graph.
POPL 1977: 104-118 |
| 7 | | Harry R. Lewis:
The Equivalence Problem for Program Schemata with Nonintersecting Loops.
POPL 1977: 253-266 |
| 1976 |
|---|
| 6 | | Harry R. Lewis:
Krom Formulas with One Dyadic Predicate Letter.
J. Symb. Log. 41(2): 341-362 (1976) |
| 1975 |
|---|
| 5 | | Warren D. Goldfarb,
Harry R. Lewis:
Skolem Reduction Classes.
J. Symb. Log. 40(1): 62-68 (1975) |
| 1974 |
|---|
| 4 | | Harry R. Lewis:
Program Schemata and the First-Order Decision Problem.
J. Comput. Syst. Sci. 8(1): 71-83 (1974) |
| 3 | | Stål Aanderaa,
Harry R. Lewis:
Linear Sampling and the forall exists forall Case of the Decision Problem.
J. Symb. Log. 39(3): 519-548 (1974) |
| 1973 |
|---|
| 2 | | Harry R. Lewis,
Warren D. Goldfarb:
The Decision Problem for Formulas with a Small Number of Atomic Subformulas.
J. Symb. Log. 38(3): 471-480 (1973) |
| 1 | | Stål Aanderaa,
Harry R. Lewis:
Prefix Classes of Krom Formulas.
J. Symb. Log. 38(4): 628-642 (1973) |
