The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harry R. Lewis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002