John Franco

According to our database, John Franco authored at least 12 papers between 1983 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

A History of Satisfiability.

John Franco, John Martin

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

2018

A Peek at the Cryptol Language.

John Franco

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

2010

Probabilistic Analysis of Satisfiability Algorithms.

John Franco, Yves Crama, Peter L. Hammer

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009

A History of Satisfiability.

John Franco, John Martin

Proceedings of the Handbook of Satisfiability, 2009

1999

The Probability of Pure Literals.

John W. Rosenthal, Jacob Manuel Plotkin, John Franco

J. Log. Comput., 1999

1996

Relative size of certain polynomial time solvable subclasses of satisfiability.

John Franco

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1988

Probabilistic performance of a heuristic for the satisfiability problem.

John Franco, Yuan Chuan Ho

Discret. Appl. Math., 1988

1987

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

1986

An approximation algorithm for the maximum independent set problem in cubic planar graphs.

Elarbi Choukhmane, John Franco

Networks, 1986

1984

Duality, finite improvement and efficiently solved optimization problems.

John Franco

SIGACT News, 1984

Probabilistic analysis of the pure literal heuristic for the satisfiability problem.

John Franco

Ann. Oper. Res., 1984

1983

Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem.

John Franco, Marvin C. Paull

Discret. Appl. Math., 1983