John V. Franco

发表

Recent work at the interface of logic, combinatorics, and computer science

J. Michael Dunn, John V. Franco, William H. Wheeler, 2005, Annals of Mathematics and Artificial Intelligence.

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..

Creating Efficient Programs by Exchanging Data for Procedures

Daniel P. Friedman, John V. Franco, 1989, Comput. Lang..

The analysis of hashing with lazy deletions

John V. Franco, Pedro Celis, 1992, Inf. Sci..

Computing Well-founded Semantics Faster

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

An Algorithm for the Class of Pure Implicational Formulas

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

On the Occurrence of Null Clauses in Random Instances of Satisfiability

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

John V. Franco, 2001, Theor. Comput. Sci..

Multi-Way Streams in Scheme

Daniel P. Friedman, Steven D. Johnson, John V. Franco, 1990, Comput. Lang..

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..

Costs of Quadtree Representation of Nondense Matrices

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

Resolution Tunnels for Improved SAT Solver Performance

Michal Kouril, John V. Franco, 2005, SAT.

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

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

Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem

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

On good algorithms for determining unsatisfiability of propositional formulas

Ramjee P. Swaminathan, John V. Franco, 2003, Discret. Appl. Math..

On Finding Solutions for Extended Horn Formulas

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

Extending Existential Quantification in Conjunctions of BDDs

John S. Schlipf, John V. Franco, Sean A. Weaver, 2006, J. Satisf. Boolean Model. Comput..

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms

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

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

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

A perspective on certain polynomial-time solvable classes of satisfiability

Allen Van Gelder, John V. Franco, A. V. Gelder, 2003, 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.

A Java Framework for Collaborative Service Sharing in a P2P Network

John V. Franco, Kedar Godbole, 2003, ISCA PDCS.

Function-Complete Lookahead in Support of Efficient SAT Search Heuristics

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

Some interesting research directions in satisfiability

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

On the Probabilistic Performance of Algorithms for the Satisfiability Problem

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

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

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

Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

John V. Franco, 2005, Discret. Appl. Math..