Harry R. Lewis

According to our database, Harry R. Lewis authored at least 31 papers between 1968 and 1998.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1998

Elements of the Theory of Computation.

Harry R. Lewis, Christos H. Papadimitriou

SIGACT News, 1998

Elements of the theory of computation, 2nd Edition.

Harry R. Lewis, Christos H. Papadimitriou

Prentice Hall, ISBN: 978-0-13-262478-7, 1998

1990

A Logic of Concrete Time Intervals (Extended Abstract)

Harry R. Lewis

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1986

Efficient Symbolic Analysis of Programs.

John H. Reif, Harry R. Lewis

J. Comput. Syst. Sci., 1986

1984

A Logic for Constant-Depth Circuits

Yuri Gurevich, Harry R. Lewis

Inf. Control., April, 1984

The Complexity of the Satisfiability Problem for Krom Formulas.

Larry Denenberg, Harry R. Lewis

Theor. Comput. Sci., 1984

The Word Problem for Cancellation Semigroups with Zero.

Yuri Gurevich, Harry R. Lewis

J. Symb. Log., 1984

1982

Symmetric Space-Bounded Computation.

Harry R. Lewis, Christos H. Papadimitriou

Theor. Comput. Sci., 1982

Conservative Reduction Classes of Krom Formulas.

Stål Aanderaa, Egon Börger, Harry R. Lewis

J. Symb. Log., 1982

Unifiability is Complete for co-NLogSpace.

Harry R. Lewis, Richard Statman

Inf. Process. Lett., 1982

The Inference Problem for Template Dependencies

Yuri Gurevich, Harry R. Lewis

Inf. Control., 1982

1981

Elements of the Theory of Computation

Harry R. Lewis, Christos H. Papadimitriou

Prentice-Hall, ISBN: 0-13-273426-5, 1981

1980

Complexity Results for Classes of Quantificational Formulas.

Harry R. Lewis

J. Comput. Syst. Sci., 1980

Embedded Implicational Dependencies and their Inference Problem.

Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky

Proceedings of the XP1 Workshop on Relational Database Theory, 30 June, 1980

Symmetric Space-Bounded Computation (Extended Abstract).

Harry R. Lewis, Christos H. Papadimitriou

Proceedings of the Automata, 1980

1979

Satisfiability Problems for Propositional Calculi.

Harry R. Lewis

Math. Syst. Theory, 1979

1978

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.

Harry R. Lewis

SIGACT News, 1978

Renaming a Set of Clauses as a Horn Set.

Harry R. Lewis

J. ACM, 1978

3-D graphic display of discrete spatial data by prism maps.

W. Randolph Franklin, Harry R. Lewis

Proceedings of the 5th Annual Conference on Computer Graphics and Interactive Techniques, 1978

Why johny can't program: a progress report.

Henry E. Leither, Harry R. Lewis

Proceedings of the Papers of the SIGCSE/CSA technical symposium on Computer science education, 1978

Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus

Harry R. Lewis

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

Symbolic Evaluation and the Global Value Graph.

John H. Reif, Harry R. Lewis

Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

The Equivalence Problem for Program Schemata with Nonintersecting Loops.

Harry R. Lewis

Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

A New Decidable Problem, with Applications (Extended Abstract)

Harry R. Lewis

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

Krom Formulas with One Dyadic Predicate Letter.

Harry R. Lewis

J. Symb. Log., 1976

1975

Skolem Reduction Classes.

Warren D. Goldfarb, Harry R. Lewis

J. Symb. Log., 1975

1974

Linear Sampling and the forall exists forall Case of the Decision Problem.

Stål Aanderaa, Harry R. Lewis

J. Symb. Log., 1974

Program Schemata and the First-Order Decision Problem.

Harry R. Lewis

J. Comput. Syst. Sci., 1974

1973

The Decision Problem for Formulas with a Small Number of Atomic Subformulas.

Harry R. Lewis, Warren D. Goldfarb

J. Symb. Log., 1973

Prefix Classes of Krom Formulas.

Stål Aanderaa, Harry R. Lewis

J. Symb. Log., 1973

1968

SHAPESHIFTER: An interactive program for experimenting with complex-plane transformations.

Harry R. Lewis

Proceedings of the 23rd ACM national conference, 1968