Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions. - John V. Franco (SIGACT News, 1985)

On the Probabilistic Performance of Algorithms for the Satisfiability Problem. - John V. Franco (Inf. Process. Lett., 1986)

Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem. - Ming-Te Chao; John V. Franco (SIAM J. Comput., 1986)

Creating Efficient Programs by Exchanging Data for Procedures. - John V. Franco; Daniel P. Friedman (Comput. Lang., 1989)

Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. - John V. Franco; Daniel P. Friedman (Comput. Lang., 1990)

Multi-Way Streams in Scheme. - John V. Franco; Daniel P. Friedman; Steven D. Johnson (Comput. Lang., 1990)

Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem. - Ming-Te Chao; John V. Franco (Inf. Sci., 1990)

Costs of Quadtree Representation of Nondense Matrices. - David S. Wise; John V. Franco (J. Parallel Distributed Comput., 1990)

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms. - John V. Franco (SIAM J. Comput., 1991)

Recent Work at the Interface of Logic, Combinatorics and Computer Science. - John V. Franco; J. Michael Dunn; William H. Wheeler (Ann. Math. Artif. Intell., 1992)

The analysis of hashing with lazy deletions. - Pedro Celis; John V. Franco (Inf. Sci., 1992)

On the Occurrence of Null Clauses in Random Instances of Satisfiability. - John V. Franco (Discret. Appl. Math., 1993)

Computing Well-founded Semantics Faster. - Kenneth A. Berman; John S. Schlipf; John V. Franco (LPNMR, 1995)

Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. - Fred S. Annexstein; John V. Franco (Discret. Appl. Math., 1995)

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. - Kenneth A. Berman; John V. Franco; John S. Schlipf (Discret. Appl. Math., 1995)

On Finding Solutions for Extended Horn Formulas. - John S. Schlipf; Fred S. Annexstein; John V. Franco; Ramjee P. Swaminathan (Inf. Process. Lett., 1995)

Algorithms for the satisfiability (SAT) problem: A survey. - Jun Gu; Paul W. Purdom; John V. Franco; Benjamin W. Wah (Satisfiability Problem: Theory and Applications, 1996)

Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. - John V. Franco; Ramjee P. Swaminathan (Ann. Math. Artif. Intell., 1997)

Algorithms for the Satisfiability (SAT) Problem. - Jun Gu; Paul W. Purdom; John V. Franco; Benjamin W. Wah (Handbook of Combinatorial Optimization, 1999)

An Algorithm for the Class of Pure Implicational Formulas. - John V. Franco; Judy Goldsmith; John S. Schlipf; Ewald Speckenmeyer; Ramjee P. Swaminathan (Discret. Appl. Math., 1999)

Some interesting research directions in satisfiability. - John V. Franco (Ann. Math. Artif. Intell., 2000)

Results related to threshold phenomena research in satisfiability: lower bounds. - John V. Franco (Theor. Comput. Sci., 2001)

A Java Framework for Collaborative Service Sharing in a P2P Network. - Kedar Godbole; John V. Franco (PDCS, 2003)

SBSAT: a State-Based, BDD-Based Satisfiability Solver. - John V. Franco; Michal Kouril; John S. Schlipf; Jeffrey Ward; Sean A. Weaver; Michael R. Dransfield; W. Mark Vanfleet (SAT, 2003)

A perspective on certain polynomial-time solvable classes of satisfiability. - John V. Franco; Allen Van Gelder (Discret. Appl. Math., 2003)

On good algorithms for determining unsatisfiability of propositional formulas. - John V. Franco; Ramjee P. Swaminathan (Discret. Appl. Math., 2003)

Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. - John V. Franco; Michal Kouril; John S. Schlipf; Sean A. Weaver; Michael R. Dransfield; W. Mark Vanfleet (J. Univers. Comput. Sci., 2004)

Resolution Tunnels for Improved SAT Solver Performance. - Michal Kouril; John V. Franco (SAT, 2005)

A sharp threshold for the renameable-Horn and the q-Horn properties. - Nadia Creignou; Hervé Daudé; John V. Franco (Discret. Appl. Math., 2005)

Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. - John V. Franco (Discret. Appl. Math., 2005)

Extending Existential Quantification in Conjunctions of BDDs. - Sean A. Weaver; John V. Franco; John S. Schlipf (J. Satisf. Boolean Model. Comput., 2006)

Improved Complexity Bound of Vertex Cover for Low degree Graph - Weiya Yue; John V. Franco; Weiwei Cao (CoRR, 2010)

ID* Lite: improved D* Lite algorithm. - Weiya Yue; John V. Franco; Weiwei Cao; Hongwei Yue (SAC, 2011)

Preface to the special issue. - John V. Franco (Ann. Math. Artif. Intell., 2011)

Application of constraints to formal verification and artificial intelligence. - Miroslav N. Velev; John V. Franco (Ann. Math. Artif. Intell., 2014)

vCDS: A Virtualized Cross Domain Solution Architecture. - Nathan Daughety; Marcus Pendleton; Shouhuai Xu; Laurent Njilla; John V. Franco (MILCOM, 2021)

Auditing a Software-Defined Cross Domain Solution Architecture. - Nathan Daughety; Marcus Pendleton; Rebeca Perez; Shouhuai Xu; John V. Franco (CSR, 2022)