J. Franco

发表

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

John Franco, Marvin C. Paull, J. Franco, 1983, Discret. Appl. Math..

Minimum Spanning Tree: A new approach to assess the quality of the design of computer experiments

J. Franco, O. Vasseur, B. Corre, 2009 .

Algorithms for the Satisfiability Problem

B. Wah, J. Franco, P. Purdom, 2018 .

A New Anytime Dynamic Navigation Algorithm

J. Franco, W. Yue, W. Cao, 2012 .

Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions

J. Franco, J. Franco, 1985, SIGA.

Reconfigurable Interconnect Synthesis via Quantified Boole an Satisfiability

J. Franco, R. Vemuri, J. Schlipf, 2002 .

Costs of Quadtree Representation of Nondense Matrices

David S. Wise, John V. Franco, J. Franco, 1990, J. Parallel Distributed Comput..

FINAL SCIENTIFIC REPORT December 1988 to June 1990 Data Compilation : It ' s Design and Analysis

J. Franco, 2022 .

Finding Optimal Boolean Classifiers

J. Franco, 2000 .

Workshop on Satisfiability

J. Franco, Certosa di Pontignano, 2009 .

Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

John Franco, John W. Rosenthal, Jacob Manuel Plotkin, 1987, Discret. Appl. Math..

Improved Anytime D* Algorithm

Weiwei Cao, Weiya Yue, John Franco, 2014 .

Algorithms for the satisfiability (SAT) problem: A survey

Jun Gu, Benjamin W. Wah, John Franco, 1996, Satisfiability Problem: Theory and Applications.

A History of Satisfiability

John Martin, John Franco, J. Franco, 2009, Handbook of Satisfiability.

Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme

Daniel P. Friedman, John V. Franco, J. Franco, 1990, Comput. Lang..

Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram

Fred S. Annexstein, John V. Franco, J. Franco, 1995, Discret. Appl. Math..

An Algorithm for the Class of Pure Implicational Formulas

Ewald Speckenmeyer, Judy Goldsmith, John S. Schlipf, 1999, Discret. Appl. Math..

Some interesting research directions in satisfiability

John V. Franco, J. Franco, 2000, Annals of Mathematics and Artificial Intelligence.

Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

Ming-Te Chao, John V. Franco, M. Chao, 1990, Inf. Sci..

Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem

Ming-Te Chao, John V. Franco, M. Chao, 1986, SIAM J. Comput..

On the Probabilistic Performance of Algorithms for the Satisfiability Problem

John V. Franco, J. Franco, 1986, Inf. Process. Lett..

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time

John S. Schlipf, Kenneth A. Berman, John Franco, 1995, Discret. Appl. Math..

Average case results for satisfiability algorithms under the random‐clause‐width model

Ramjee P. Swaminathan, John V. Franco, J. Franco, 1997, Annals of Mathematics and Artificial Intelligence.

On Finding Solutions for Extended Horn Formulas

Fred S. Annexstein, John S. Schlipf, Ramjee P. Swaminathan, 1995, Inf. Process. Lett..

Probabilistic Analysis of Satisfiability Algorithms

Peter L. Hammer, Yves Crama, John Franco, 2010, Boolean Models and Methods.

A sharp threshold for the renameable-Horn and the q-Horn properties

Nadia Creignou, John V. Franco, Hervé Daudé, 2005, Discret. Appl. Math..

SBSAT: a State-Based, BDD-Based Satisfiability Solver

Michal Kouril, Michael R. Dransfield, John S. Schlipf, 2003, SAT.

A perspective on certain polynomial-time solvable classes of satisfiability

Allen Van Gelder, John V. Franco, A. V. Gelder, 2003, Discret. Appl. Math..

The Probability of Pure Literals

John Franco, John W. Rosenthal, Jacob Manuel Plotkin, 1999, J. Log. Comput..

On the Occurrence of Null Clauses in Random Instances of Satisfiability

John V. Franco, J. Franco, 1993, Discret. Appl. Math..

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms

John V. Franco, J. Franco, 1991, SIAM J. Comput..

Probabilistic performance of a heuristic for the satisfiability problem

John Franco, Yuan Chuan Ho, J. Franco, 1988, Discret. Appl. Math..

Function-Complete Lookahead in Support of Efficient SAT Search Heuristics

Michal Kouril, Michael R. Dransfield, John S. Schlipf, 2004, J. Univers. Comput. Sci..