John V. Franco

According to our database, John V. Franco authored at least 37 papers between 1985 and 2022.

Collaborative distances:

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

2022

Auditing a Software-Defined Cross Domain Solution Architecture.

Nathan Daughety, Marcus Pendleton, Rebeca Perez, Shouhuai Xu, John V. Franco

Proceedings of the IEEE International Conference on Cyber Security and Resilience, 2022

2021

vCDS: A Virtualized Cross Domain Solution Architecture.

Nathan Daughety, Marcus Pendleton, Shouhuai Xu, Laurent Njilla, John V. Franco

Proceedings of the 2021 IEEE Military Communications Conference, 2021

2014

Application of constraints to formal verification and artificial intelligence.

Miroslav N. Velev, John V. Franco

Ann. Math. Artif. Intell., 2014

2011

Preface to the special issue.

John V. Franco

Ann. Math. Artif. Intell., 2011

ID* Lite: improved D* Lite algorithm.

Weiya Yue, John V. Franco, Weiwei Cao, Hongwei Yue

Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

2010

Improved Complexity Bound of Vertex Cover for Low degree Graph

Weiya Yue, John V. Franco, Weiwei Cao

CoRR, 2010

2006

Extending Existential Quantification in Conjunctions of BDDs.

Sean A. Weaver, John V. Franco, John S. Schlipf

J. Satisf. Boolean Model. Comput., 2006

2005

Typical case complexity of Satisfiability Algorithms and the threshold phenomenon.

John V. Franco

Discret. Appl. Math., 2005

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

Nadia Creignou, Hervé Daudé, John V. Franco

Discret. Appl. Math., 2005

Resolution Tunnels for Improved SAT Solver Performance.

Michal Kouril, John V. Franco

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

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

2003

On good algorithms for determining unsatisfiability of propositional formulas.

John V. Franco, Ramjee P. Swaminathan

Discret. Appl. Math., 2003

A perspective on certain polynomial-time solvable classes of satisfiability.

John V. Franco, Allen Van Gelder

Discret. Appl. Math., 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

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

A Java Framework for Collaborative Service Sharing in a P2P Network.

Kedar Godbole, John V. Franco

Proceedings of the ISCA 16th International Conference on Parallel and Distributed Computing Systems, 2003

2001

Results related to threshold phenomena research in satisfiability: lower bounds.

John V. Franco

Theor. Comput. Sci., 2001

2000

Some interesting research directions in satisfiability.

John V. Franco

Ann. Math. Artif. Intell., 2000

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

Algorithms for the Satisfiability (SAT) Problem.

Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah

Proceedings of the Handbook of Combinatorial Optimization, 1999

1997

Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model.

John V. Franco, Ramjee P. Swaminathan

Ann. Math. Artif. Intell., 1997

1996

Algorithms for the satisfiability (SAT) problem: A survey.

Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1995

On Finding Solutions for Extended Horn Formulas.

John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan

Inf. Process. Lett., 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

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

Fred S. Annexstein, John V. Franco

Discret. Appl. Math., 1995

Computing Well-founded Semantics Faster.

Kenneth A. Berman, John S. Schlipf, John V. Franco

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1993

On the Occurrence of Null Clauses in Random Instances of Satisfiability.

John V. Franco

Discret. Appl. Math., 1993

1992

The analysis of hashing with lazy deletions.

Pedro Celis, John V. Franco

Inf. Sci., 1992

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

1991

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms.

John V. Franco

SIAM J. Comput., 1991

1990

Costs of Quadtree Representation of Nondense Matrices.

David S. Wise, John V. Franco

J. Parallel Distributed Comput., 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

Multi-Way Streams in Scheme.

John V. Franco, Daniel P. Friedman, Steven D. Johnson

Comput. Lang., 1990

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

John V. Franco, Daniel P. Friedman

Comput. Lang., 1990

1989

Creating Efficient Programs by Exchanging Data for Procedures.

John V. Franco, Daniel P. Friedman

Comput. Lang., 1989

1986

Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem.

Ming-Te Chao, John V. Franco

SIAM J. Comput., 1986

On the Probabilistic Performance of Algorithms for the Satisfiability Problem.

John V. Franco

Inf. Process. Lett., 1986

1985

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

John V. Franco

SIGACT News, 1985