Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. - John Franco; Marvin C. Paull (Discret. Appl. Math., 1983)

Probabilistic analysis of the pure literal heuristic for the satisfiability problem. - John Franco (Ann. Oper. Res., 1984)

Duality, finite improvement and efficiently solved optimization problems. - John Franco (SIGACT News, 1984)

An approximation algorithm for the maximum independent set problem in cubic planar graphs. - Elarbi Choukhmane; John Franco (Networks, 1986)

Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. - John Franco; Jacob Manuel Plotkin; John W. Rosenthal (Discret. Appl. Math., 1987)

Probabilistic performance of a heuristic for the satisfiability problem. - John Franco; Yuan Chuan Ho (Discret. Appl. Math., 1988)

Relative size of certain polynomial time solvable subclasses of satisfiability. - John Franco (Satisfiability Problem: Theory and Applications, 1996)

The Probability of Pure Literals. - John W. Rosenthal; Jacob Manuel Plotkin; John Franco (J. Log. Comput., 1999)

A History of Satisfiability. - John Franco; John Martin (Handbook of Satisfiability, 2009)

Probabilistic Analysis of Satisfiability Algorithms. - John Franco; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

A Peek at the Cryptol Language. - John Franco (ISAIM, 2018)

A History of Satisfiability. - John Franco; John Martin (Handbook of Satisfiability, 2021)