default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDForbes D. Lewis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1970
[b1]Forbes D. Lewis:
Unsolvability Considerations in Computational Complexity. Cornell University, USA, 1970
Journal Articles
- 1981
- [j8]Forbes D. Lewis:
Stateless turing machines and fixed points. Int. J. Parallel Program. 10(3): 215-218 (1981) - [j7]Forbes D. Lewis:
A Note on Context Free Languages, Complexity Classes, and Diagonalization. Math. Syst. Theory 14: 223-227 (1981) - 1980
- [j6]Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis:
Complex Properties of Grammars. J. ACM 27(3): 484-498 (1980) - 1979
- [j5]Yuri Breitbart, Forbes D. Lewis:
Combined complexity classes for finite functions. RAIRO Theor. Informatics Appl. 13(1): 87-97 (1979) - [j4]Forbes D. Lewis:
On unsolvability in subrecursive classes of predicates. Notre Dame J. Formal Log. 20(1): 55-67 (1979) - 1976
- [j3]Forbes D. Lewis:
On Computational Reducibility. J. Comput. Syst. Sci. 12(1): 122-131 (1976) - 1971
- [j2]Juris Hartmanis, Forbes D. Lewis:
The use of Lists in the Study of Undecidable Problems in Automata Theory. J. Comput. Syst. Sci. 5(1): 54-66 (1971) - [j1]Forbes D. Lewis:
The Enumerability and Invariance of Complexity Classes. J. Comput. Syst. Sci. 5(3): 286-303 (1971)
Conference and Workshop Papers
- 1993
- [c6]Forbes D. Lewis, Wang Chia-Chi Pong:
A Negative Reinforcement Method for PGA Routing. DAC 1993: 601-605 - [c5]Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave:
Local improvement in Steiner trees. Great Lakes Symposium on VLSI 1993: 105-106 - 1992
- [c4]Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave:
Optimum Steiner tree generation. Great Lakes Symposium on VLSI 1992: 207-212 - 1991
- [c3]Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave:
A linear-time heuristic for rectilinear Steiner trees. Great Lakes Symposium on VLSI 1991: 152-156 - 1989
- [c2]Forbes D. Lewis, Nancy K. Van Cleave:
Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation. Great Lakes Computer Science Conference 1989: 329-335 - 1970
- [c1]Forbes D. Lewis:
Unsolvability Considerations in Computational Complexity. STOC 1970: 22-30
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:17 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:
