default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Franco
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p3]John Franco, John Martin:
A History of Satisfiability. Handbook of Satisfiability 2021: 3-74
2010 – 2019
- 2018
- [c2]John Franco:
A Peek at the Cryptol Language. ISAIM 2018 - 2010
- [p2]John Franco, Yves Crama, Peter L. Hammer:
Probabilistic Analysis of Satisfiability Algorithms. Boolean Models and Methods 2010: 99-159
2000 – 2009
- 2009
- [p1]John Franco, John Martin:
A History of Satisfiability. Handbook of Satisfiability 2009: 3-74
1990 – 1999
- 1999
- [j8]John W. Rosenthal, Jacob Manuel Plotkin, John Franco:
The Probability of Pure Literals. J. Log. Comput. 9(4): 501-513 (1999) - 1996
- [c1]John Franco:
Relative size of certain polynomial time solvable subclasses of satisfiability. Satisfiability Problem: Theory and Applications 1996: 211-223
1980 – 1989
- 1988
- [j7]John Franco, Yuan Chuan Ho:
Probabilistic performance of a heuristic for the satisfiability problem. Discret. Appl. Math. 22(1): 35-51 (1988) - 1987
- [j6]John Franco, Jacob Manuel Plotkin, John W. Rosenthal:
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discret. Appl. Math. 17(3): 295-299 (1987) - 1986
- [j5]Elarbi Choukhmane, John Franco:
An approximation algorithm for the maximum independent set problem in cubic planar graphs. Networks 16(4): 349-356 (1986) - 1984
- [j4]John Franco:
Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Ann. Oper. Res. 1(3): 273-289 (1984) - [j3]John Franco:
Duality, finite improvement and efficiently solved optimization problems. SIGACT News 15(4): 62 (1984) - [j2]John Franco:
Duality, finite improvement and efficiently solved optimization problems. SIGACT News 16(1): 62 (1984) - 1983
- [j1]John Franco, Marvin C. Paull:
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discret. Appl. Math. 5(1): 77-87 (1983)
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 22:58 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:
