Harry R. Lewis

Publication Activity (10 Years)

Years Active: 1968-1998
Publications (10 Years): 0

Publications

Harry R. Lewis, Christos H. Papadimitriou
Elements of the Theory of Computation. SIGACT News 29 (3) (1998)
Harry R. Lewis
A Logic of Concrete Time Intervals (Extended Abstract) LICS (1990)
John H. Reif, Harry R. Lewis
Efficient Symbolic Analysis of Programs. J. Comput. Syst. Sci. 32 (3) (1986)
Yuri Gurevich, Harry R. Lewis
The Word Problem for Cancellation Semigroups with Zero. J. Symb. Log. 49 (1) (1984)
Yuri Gurevich, Harry R. Lewis
A Logic for Constant-Depth Circuits Inf. Control. 61 (1) (1984)
Larry Denenberg, Harry R. Lewis
The Complexity of the Satisfiability Problem for Krom Formulas. Theor. Comput. Sci. 30 (1984)
Harry R. Lewis, Christos H. Papadimitriou
Symmetric Space-Bounded Computation. Theor. Comput. Sci. 19 (1982)
Stål Aanderaa, Egon Börger, Harry R. Lewis
Conservative Reduction Classes of Krom Formulas. J. Symb. Log. 47 (1) (1982)
Yuri Gurevich, Harry R. Lewis
The Inference Problem for Template Dependencies Inf. Control. 55 (1-3) (1982)
Yuri Gurevich, Harry R. Lewis
The Inference Problem for Template Dependencies. PODS (1982)
Harry R. Lewis, Richard Statman
Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15 (5) (1982)
Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
Embedded Implicational Dependencies and their Inference Problem STOC (1981)
Harry R. Lewis
Complexity Results for Classes of Quantificational Formulas. J. Comput. Syst. Sci. 21 (3) (1980)
Harry R. Lewis, Christos H. Papadimitriou
Symmetric Space-Bounded Computation (Extended Abstract). ICALP (1980)
Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
Embedded Implicational Dependencies and their Inference Problem. XP1 Workshop on Database Theory (1980)
Harry R. Lewis
Satisfiability Problems for Propositional Calculi. Math. Syst. Theory 13 (1979)
Harry R. Lewis
Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus FOCS (1978)
W. Randolph Franklin, Harry R. Lewis
3-D graphic display of discrete spatial data by prism maps. SIGGRAPH (1978)
Henry E. Leither, Harry R. Lewis
Why johny can't program: a progress report. SIGCSE/CSA (1978)
Harry R. Lewis
Renaming a Set of Clauses as a Horn Set. J. ACM 25 (1) (1978)
Harry R. Lewis
Review of "Mariages stables et leur relations avec d'autre problèmes combinatoires: introduction à l'analyze mathématique des algorithmes" by Donald E. Knuth. Les Presses de l'Université de Montréal. SIGACT News 9 (4) (1978)
John H. Reif, Harry R. Lewis
Symbolic Evaluation and the Global Value Graph. POPL (1977)
Harry R. Lewis
The Equivalence Problem for Program Schemata with Nonintersecting Loops. POPL (1977)
Harry R. Lewis
A New Decidable Problem, with Applications (Extended Abstract) FOCS (1977)
Harry R. Lewis
Krom Formulas with One Dyadic Predicate Letter. J. Symb. Log. 41 (2) (1976)
Warren D. Goldfarb, Harry R. Lewis
Skolem Reduction Classes. J. Symb. Log. 40 (1) (1975)
Harry R. Lewis
Program Schemata and the First-Order Decision Problem. J. Comput. Syst. Sci. 8 (1) (1974)
Stål Aanderaa, Harry R. Lewis
Linear Sampling and the forall exists forall Case of the Decision Problem. J. Symb. Log. 39 (3) (1974)
Stål Aanderaa, Harry R. Lewis
Prefix Classes of Krom Formulas. J. Symb. Log. 38 (4) (1973)
Harry R. Lewis, Warren D. Goldfarb
The Decision Problem for Formulas with a Small Number of Atomic Subformulas. J. Symb. Log. 38 (3) (1973)
Harry R. Lewis
SHAPESHIFTER: An interactive program for experimenting with complex-plane transformations. ACM National Conference (1968)