John V. Franco - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2006

Extending Existential Quantification in Conjunctions of BDDsSean Weaver, John V. Franco, John S. Schlipf. jsat, 1(2):89-110, 2006. [doi]

2005

A sharp threshold for the renameable-Horn and the q-Horn propertiesNadia Creignou, Hervé Daudé, John V. Franco. DAM, 153(1-3):48-57, 2005. [doi]

Typical case complexity of Satisfiability Algorithms and the threshold phenomenonJohn V. Franco. DAM, 153(1-3):89-123, 2005. [doi]

Resolution Tunnels for Improved SAT Solver PerformanceMichal Kouril, John V. Franco. sat 2005: 143-157 [doi]

2004

Function-Complete Lookahead in Support of Efficient SAT Search HeuristicsJohn V. Franco, Michal Kouril, John S. Schlipf, Sean Weaver, Michael Dransfield, W. Mark Vanfleet. jucs, 10(12):1655-1695, 2004. [doi]

2003

2001

Results related to threshold phenomena research in satisfiability: lower boundsJohn V. Franco. TCS, 265(1-2):147-157, 2001. [doi]

2000

Some interesting research directions in satisfiabilityJohn V. Franco. AMAI, 28(1-4):7-15, 2000.

1999

An Algorithm for the Class of Pure Implicational FormulasJohn V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan. DAM, 96-97:89-106, 1999. [doi]

1997

Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width ModelJohn V. Franco, Ramjee P. Swaminathan. AMAI, 20(1-4):357-391, 1997.

1995

1993

On the Occurrence of Null Clauses in Random Instances of SatisfiabilityJohn V. Franco. DAM, 41(3):203-209, 1993. [doi]

1992

The analysis of hashing with lazy deletionsPedro Celis, John V. Franco. isci, 62(1-2):13-26, 1992. [doi]

Recent Work at the Interface of Logic, Combinatorics and Computer ScienceJohn V. Franco, J. Michael Dunn, William H. Wheeler. AMAI, 6(1-3):1-15, 1992.

1991

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability AlgorithmsJohn V. Franco. SICOMP, 20(6):1119-1127, 1991.

1990

Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problemMing-Te Chao, John V. Franco. isci, 51(3):289-314, 1990. [doi]

Multi-Way Streams in SchemeJohn V. Franco, Daniel P. Friedman, Steven D. Johnson. Comp. Lang., Syst. \& Struct., 15(1):109-125, 1990.

Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in SchemeJohn V. Franco, Daniel P. Friedman. Comp. Lang., Syst. \& Struct., 15(1):54-64, 1990.

Costs of Quadtree Representation of Nondense MatricesDavid S. Wise, John V. Franco. jpdc, 9(3):282-296, 1990.

1989

Creating Efficient Programs by Exchanging Data for ProceduresJohn V. Franco, Daniel P. Friedman. Comp. Lang., Syst. \& Struct., 14(1):11-23, 1989.

1986

Probabilistic Analysis of Two Heuristics for the 3-Satisfiability ProblemMing-Te Chao, John V. Franco. SICOMP, 15(4):1106-1118, 1986.

On the Probabilistic Performance of Algorithms for the Satisfiability ProblemJohn V. Franco. ipl, 23(2):103-106, 1986.

1985

Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributionsJohn V. Franco. sigact, 17(1):40-59, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL