John V. Franco

Publication Activity (10 Years)

Years Active: 1985-2006
Publications (10 Years): 0

Publications

Sean A. Weaver, John V. Franco, John S. Schlipf
Extending Existential Quantification in Conjunctions of BDDs. J. Satisf. Boolean Model. Comput. 1 (2) (2006)
Nadia Creignou, Hervé Daudé, John V. Franco
A sharp threshold for the renameable-Horn and the q-Horn properties. Discret. Appl. Math. 153 (1-3) (2005)
John V. Franco
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. Discret. Appl. Math. 153 (1-3) (2005)
Michal Kouril, John V. Franco
Resolution Tunnels for Improved SAT Solver Performance. SAT (2005)
John V. Franco, Michal Kouril, John S. Schlipf, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. Univers. Comput. Sci. 10 (12) (2004)
John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
SBSAT: a State-Based, BDD-Based Satisfiability Solver. SAT (2003)
Kedar Godbole, John V. Franco
A Java Framework for Collaborative Service Sharing in a P2P Network. PDCS (2003)
John V. Franco, Allen Van Gelder
A perspective on certain polynomial-time solvable classes of satisfiability. Discret. Appl. Math. 125 (2-3) (2003)
John V. Franco, Ramjee P. Swaminathan
On good algorithms for determining unsatisfiability of propositional formulas. Discret. Appl. Math. 130 (2) (2003)
John V. Franco
Results related to threshold phenomena research in satisfiability: lower bounds. Theor. Comput. Sci. 265 (1-2) (2001)
John V. Franco
Some interesting research directions in satisfiability. Ann. Math. Artif. Intell. 28 (1-4) (2000)
John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. (1999)
John V. Franco, Ramjee P. Swaminathan
Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. Ann. Math. Artif. Intell. 20 (1-4) (1997)
Kenneth A. Berman, John S. Schlipf, John V. Franco
Computing Well-founded Semantics Faster. LPNMR (1995)
Kenneth A. Berman, John V. Franco, John S. Schlipf
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. 60 (1-3) (1995)
Fred S. Annexstein, John V. Franco
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. Discret. Appl. Math. 60 (1-3) (1995)
John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54 (3) (1995)
John V. Franco
On the Occurrence of Null Clauses in Random Instances of Satisfiability. Discret. Appl. Math. 41 (3) (1993)
John V. Franco, J. Michael Dunn, William H. Wheeler
Recent Work at the Interface of Logic, Combinatorics and Computer Science. Ann. Math. Artif. Intell. 6 (1-3) (1992)
Pedro Celis, John V. Franco
The analysis of hashing with lazy deletions. Inf. Sci. 62 (1-2) (1992)
John V. Franco
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms. SIAM J. Comput. 20 (6) (1991)
Ming-Te Chao, John V. Franco
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem. Inf. Sci. 51 (3) (1990)
John V. Franco, Daniel P. Friedman, Steven D. Johnson
Multi-Way Streams in Scheme. Comput. Lang. 15 (1) (1990)
John V. Franco, Daniel P. Friedman
Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. 15 (1) (1990)
David S. Wise, John V. Franco
Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distributed Comput. 9 (3) (1990)
John V. Franco, Daniel P. Friedman
Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. 14 (1) (1989)
John V. Franco
On the Probabilistic Performance of Algorithms for the Satisfiability Problem. Inf. Process. Lett. 23 (2) (1986)
Ming-Te Chao, John V. Franco
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem. SIAM J. Comput. 15 (4) (1986)
John V. Franco
Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions. SIGACT News 17 (1) (1985)