Harry R. Lewis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

1998

Elements of the theory of computation (2. ed.)Harry R. Lewis, Christos H. Papadimitriou. Prentice Hall, 1998.

Elements of the Theory of ComputationHarry R. Lewis, Christos H. Papadimitriou. sigact, 29(3):62-78, 1998. [doi]

1990

A Logic of Concrete Time Intervals (Extended Abstract)Harry R. Lewis. lics 1990: 380-389

1986

Efficient Symbolic Analysis of ProgramsJohn H. Reif, Harry R. Lewis. jcss, 32(3):280-314, 1986.

1984

The Complexity of the Satisfiability Problem for Krom FormulasLarry Denenberg, Harry R. Lewis. TCS, 30:319-341, 1984.

A Logic for Constant-Depth CircuitsYuri Gurevich, Harry R. Lewis. iandc, 61(1):65-74, April 1984.

The Word Problem for Cancellation Semigroups with ZeroYuri Gurevich, Harry R. Lewis. JSYML, 49(1):184-191, 1984.

1982

Conservative Reduction Classes of Krom FormulasStål Aanderaa, Egon Börger, Harry R. Lewis. JSYML, 47(1):110-130, 1982.

The Inference Problem for Template DependenciesYuri Gurevich, Harry R. Lewis. iandc, 55(1-3):69-79, October/November/December 1982.

The Inference Problem for Template DependenciesYuri Gurevich, Harry R. Lewis. PODS 1982: 221-229 [doi]

Unifiability is Complete for co-NLogSpaceHarry R. Lewis, Richard Statman. ipl, 15(5):220-222, 1982.

Symmetric Space-Bounded ComputationHarry R. Lewis, Christos H. Papadimitriou. TCS, 19:161-187, 1982.

1981

Embedded Implicational Dependencies and their Inference ProblemAshok K. Chandra, Harry R. Lewis, Johann A. Makowsky. stoc 1981: 342-354

Elements of the Theory of ComputationHarry R. Lewis, Christos H. Papadimitriou. Prentice-Hall, 1981.

1980

Embedded Implicational Dependencies and their Inference ProblemAshok K. Chandra, Harry R. Lewis, Johann A. Makowsky. xp 1980:

Complexity Results for Classes of Quantificational FormulasHarry R. Lewis. jcss, 21(3):317-353, 1980.

Symmetric Space-Bounded Computation (Extended Abstract)Harry R. Lewis, Christos H. Papadimitriou. icalp 1980: 374-384

1979

Satisfiability Problems for Propositional CalculiHarry R. Lewis. mst, 13:45-53, 1979.

1978

1977

A New Decidable Problem, with Applications (Extended Abstract)Harry R. Lewis. focs 1977: 62-73

The Equivalence Problem for Program Schemata with Nonintersecting LoopsHarry R. Lewis. POPL 1977: 253-266

Symbolic Evaluation and the Global Value GraphJohn H. Reif, Harry R. Lewis. POPL 1977: 104-118

1976

Krom Formulas with One Dyadic Predicate LetterHarry R. Lewis. JSYML, 41(2):341-362, 1976.

1975

Skolem Reduction ClassesWarren D. Goldfarb, Harry R. Lewis. JSYML, 40(1):62-68, 1975.

1974

Linear Sampling and the forall exists forall Case of the Decision ProblemStål Aanderaa, Harry R. Lewis. JSYML, 39(3):519-548, 1974.

Program Schemata and the First-Order Decision ProblemHarry R. Lewis. jcss, 8(1):71-83, 1974.

1973

Prefix Classes of Krom FormulasStål Aanderaa, Harry R. Lewis. JSYML, 38(4):628-642, 1973.

The Decision Problem for Formulas with a Small Number of Atomic SubformulasHarry R. Lewis, Warren D. Goldfarb. JSYML, 38(3):471-480, 1973.

1968

SHAPESHIFTER: An interactive program for experimenting with complex-plane transformationsHarry R. Lewis. acm 1968: 717-724 [doi]

Sign in or sign up to see more results.

runs on WebDSL