default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarry R. Lewis
Person information
- affiliation: Harvard University, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[b2]Harry R. Lewis, Christos H. Papadimitriou:
Elements of the theory of computation, 2nd Edition. Prentice Hall 1998, ISBN 978-0-13-262478-7, pp. 1-361- [j19]Harry R. Lewis, Christos H. Papadimitriou:
Elements of the Theory of Computation. SIGACT News 29(3): 62-78 (1998) - 1990
- [c12]Harry R. Lewis:
A Logic of Concrete Time Intervals (Extended Abstract). LICS 1990: 380-389
1980 – 1989
- 1986
- [j18]John H. Reif, Harry R. Lewis:
Efficient Symbolic Analysis of Programs. J. Comput. Syst. Sci. 32(3): 280-314 (1986) - 1984
- [j17]Yuri Gurevich, Harry R. Lewis:
A Logic for Constant-Depth Circuits. Inf. Control. 61(1): 65-74 (1984) - [j16]Yuri Gurevich, Harry R. Lewis:
The Word Problem for Cancellation Semigroups with Zero. J. Symb. Log. 49(1): 184-191 (1984) - [j15]Larry Denenberg, Harry R. Lewis:
The Complexity of the Satisfiability Problem for Krom Formulas. Theor. Comput. Sci. 30: 319-341 (1984) - 1982
- [j14]Yuri Gurevich, Harry R. Lewis:
The Inference Problem for Template Dependencies. Inf. Control. 55(1-3): 69-79 (1982) - [j13]Harry R. Lewis, Richard Statman:
Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15(5): 220-222 (1982) - [j12]Stål Aanderaa, Egon Börger, Harry R. Lewis:
Conservative Reduction Classes of Krom Formulas. J. Symb. Log. 47(1): 110-130 (1982) - [j11]Harry R. Lewis, Christos H. Papadimitriou:
Symmetric Space-Bounded Computation. Theor. Comput. Sci. 19: 161-187 (1982) - [c11]Yuri Gurevich, Harry R. Lewis:
The Inference Problem for Template Dependencies. PODS 1982: 221-229 - [e1]Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, Lawrence H. Landweber:
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA. ACM 1982, ISBN 0-89791-067-2 [contents] - 1981
- [b1]Harry R. Lewis, Christos H. Papadimitriou:
Elements of the Theory of Computation. Prentice-Hall 1981, ISBN 0-13-273417-6, pp. I-XIV, 1-466 - [c10]Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354 - 1980
- [j10]Harry R. Lewis:
Complexity Results for Classes of Quantificational Formulas. J. Comput. Syst. Sci. 21(3): 317-353 (1980) - [c9]Harry R. Lewis, Christos H. Papadimitriou:
Symmetric Space-Bounded Computation (Extended Abstract). ICALP 1980: 374-384 - [c8]Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem. XP1 Workshop on Database Theory 1980
1970 – 1979
- 1979
- [j9]Harry R. Lewis:
Satisfiability Problems for Propositional Calculi. Math. Syst. Theory 13: 45-53 (1979) - 1978
- [j8]Harry R. Lewis:
Renaming a Set of Clauses as a Horn Set. J. ACM 25(1): 134-135 (1978) - [j7]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): 13-14 (1978) - [c7]Harry R. Lewis:
Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus. FOCS 1978: 35-47 - [c6]Henry E. Leither, Harry R. Lewis:
Why johny can't program: a progress report. SIGCSE/CSA 1978: 266-276 - [c5]W. Randolph Franklin, Harry R. Lewis:
3-D graphic display of discrete spatial data by prism maps. SIGGRAPH 1978: 70-75 - 1977
- [c4]Harry R. Lewis:
A New Decidable Problem, with Applications (Extended Abstract). FOCS 1977: 62-73 - [c3]John H. Reif, Harry R. Lewis:
Symbolic Evaluation and the Global Value Graph. POPL 1977: 104-118 - [c2]Harry R. Lewis:
The Equivalence Problem for Program Schemata with Nonintersecting Loops. POPL 1977: 253-266 - 1976
- [j6]Harry R. Lewis:
Krom Formulas with One Dyadic Predicate Letter. J. Symb. Log. 41(2): 341-362 (1976) - 1975
- [j5]Warren D. Goldfarb, Harry R. Lewis:
Skolem Reduction Classes. J. Symb. Log. 40(1): 62-68 (1975) - 1974
- [j4]Harry R. Lewis:
Program Schemata and the First-Order Decision Problem. J. Comput. Syst. Sci. 8(1): 71-83 (1974) - [j3]Stål Aanderaa, Harry R. Lewis:
Linear Sampling and the forall exists forall Case of the Decision Problem. J. Symb. Log. 39(3): 519-548 (1974) - 1973
- [j2]Harry R. Lewis, Warren D. Goldfarb:
The Decision Problem for Formulas with a Small Number of Atomic Subformulas. J. Symb. Log. 38(3): 471-480 (1973) - [j1]Stål Aanderaa, Harry R. Lewis:
Prefix Classes of Krom Formulas. J. Symb. Log. 38(4): 628-642 (1973)
1960 – 1969
- 1968
- [c1]Harry R. Lewis:
SHAPESHIFTER: An interactive program for experimenting with complex-plane transformations. ACM National Conference 1968: 717-724
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
