Harry R. Lewis

34 papers A* 10Journal 19Unranked 3
YearRankTypeTitle / Venue / Authors
1998 J jnl
Elements of the Theory of Computation.
SIGACT News
Harry R. Lewis, Christos H. Papadimitriou
1998 — book
Elements of the theory of computation, 2nd Edition.
Harry R. Lewis, Christos H. Papadimitriou
1990 A* conf
A Logic of Concrete Time Intervals (Extended Abstract)
LICS
Harry R. Lewis
1986 J jnl
Efficient Symbolic Analysis of Programs.
J. Comput. Syst. Sci.
John H. Reif, Harry R. Lewis
1984 J jnl
A Logic for Constant-Depth Circuits
Inf. Control.
Yuri Gurevich, Harry R. Lewis
1984 J jnl
The Complexity of the Satisfiability Problem for Krom Formulas.
Theor. Comput. Sci.
Larry Denenberg, Harry R. Lewis
1984 J jnl
The Word Problem for Cancellation Semigroups with Zero.
J. Symb. Log.
Yuri Gurevich, Harry R. Lewis
1982 J jnl
Conservative Reduction Classes of Krom Formulas.
J. Symb. Log.
Stål Aanderaa, Egon Börger, Harry R. Lewis
1982 A* ed.
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA
STOC
Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, Lawrence H. Landweber
1982 J jnl
Symmetric Space-Bounded Computation.
Theor. Comput. Sci.
Harry R. Lewis, Christos H. Papadimitriou
1982 J jnl
The Inference Problem for Template Dependencies
Inf. Control.
Yuri Gurevich, Harry R. Lewis
1982 A* conf
The Inference Problem for Template Dependencies.
PODS
Yuri Gurevich, Harry R. Lewis
1982 J jnl
Unifiability is Complete for co-NLogSpace.
Inf. Process. Lett.
Harry R. Lewis, Richard Statman
1981 — book
Elements of the Theory of Computation
Harry R. Lewis, Christos H. Papadimitriou
1981 A* conf
Embedded Implicational Dependencies and their Inference Problem
STOC
Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
1980 J jnl
Complexity Results for Classes of Quantificational Formulas.
J. Comput. Syst. Sci.
Harry R. Lewis
1980 — conf
Embedded Implicational Dependencies and their Inference Problem.
XP1 Workshop on Database Theory
Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
1980 A* conf
Symmetric Space-Bounded Computation (Extended Abstract).
ICALP
Harry R. Lewis, Christos H. Papadimitriou
1979 J jnl
Satisfiability Problems for Propositional Calculi.
Math. Syst. Theory
Harry R. Lewis
1978 A* conf
3-D graphic display of discrete spatial data by prism maps.
SIGGRAPH
W. Randolph Franklin, Harry R. Lewis
1978 A* conf
Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus
FOCS
Harry R. Lewis
1978 J jnl
Renaming a Set of Clauses as a Horn Set.
J. ACM
Harry R. Lewis
1978 J jnl
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
Harry R. Lewis
1978 — conf
Why johny can't program: a progress report.
SIGCSE/CSA
Henry E. Leither, Harry R. Lewis
1977 A* conf
A New Decidable Problem, with Applications (Extended Abstract)
FOCS
Harry R. Lewis
1977 A* conf
Symbolic Evaluation and the Global Value Graph.
POPL
John H. Reif, Harry R. Lewis
1977 A* conf
The Equivalence Problem for Program Schemata with Nonintersecting Loops.
POPL
Harry R. Lewis
1976 J jnl
Krom Formulas with One Dyadic Predicate Letter.
J. Symb. Log.
Harry R. Lewis
1975 J jnl
Skolem Reduction Classes.
J. Symb. Log.
Warren D. Goldfarb, Harry R. Lewis
1974 J jnl
Linear Sampling and the forall exists forall Case of the Decision Problem.
J. Symb. Log.
Stål Aanderaa, Harry R. Lewis
1974 J jnl
Program Schemata and the First-Order Decision Problem.
J. Comput. Syst. Sci.
Harry R. Lewis
1973 J jnl
Prefix Classes of Krom Formulas.
J. Symb. Log.
Stål Aanderaa, Harry R. Lewis
1973 J jnl
The Decision Problem for Formulas with a Small Number of Atomic Subformulas.
J. Symb. Log.
Harry R. Lewis, Warren D. Goldfarb
1968 — conf
SHAPESHIFTER: An interactive program for experimenting with complex-plane transformations.
ACM National Conference
Harry R. Lewis