John V. Franco

2006
28	EE	Sean Weaver, John V. Franco, John S. Schlipf: Extending Existential Quantification in Conjunctions of BDDs. JSAT 1(2): 89-110 (2006)
2005
27	EE	Michal Kouril, John V. Franco: Resolution Tunnels for Improved SAT Solver Performance. SAT 2005: 143-157
26	EE	Nadia Creignou, Hervé Daudé, John V. Franco: A sharp threshold for the renameable-Horn and the q-Horn properties. Discrete Applied Mathematics 153(1-3): 48-57 (2005)
25	EE	John V. Franco: Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. Discrete Applied Mathematics 153(1-3): 89-123 (2005)
2004
24	EE	John V. Franco, Michal Kouril, John S. Schlipf, Sean Weaver, Michael Dransfield, W. Mark Vanfleet: Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. UCS 10(12): 1655-1695 (2004)
2003
23		Kedar Godbole, John V. Franco: A Java Framework for Collaborative Service Sharing in a P2P Network. ISCA PDCS 2003: 105-111
22	EE	John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean Weaver, Michael Dransfield, W. Mark Vanfleet: SBSAT: a State-Based, BDD-Based Satisfiability Solver. SAT 2003: 398-410
21		John V. Franco, Allen Van Gelder: A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Applied Mathematics 125(2-3): 177-214 (2003)
20	EE	John V. Franco, Ramjee P. Swaminathan: On good algorithms for determining unsatisfiability of propositional formulas. Discrete Applied Mathematics 130(2): 129-138 (2003)
2001
19	EE	John V. Franco: Results related to threshold phenomena research in satisfiability: lower bounds. Theor. Comput. Sci. 265(1-2): 147-157 (2001)
2000
18		John V. Franco: Some interesting research directions in satisfiability. Ann. Math. Artif. Intell. 28(1-4): 7-15 (2000)
1999
17	EE	John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan: An Algorithm for the Class of Pure Implicational Formulas. Discrete Applied Mathematics 96-97: 89-106 (1999)
1997
16		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): 357-391 (1997)
1995
15		Kenneth A. Berman, John S. Schlipf, John V. Franco: Computing Well-founded Semantics Faster. LPNMR 1995: 113-126
14	EE	Fred S. Annexstein, John V. Franco: Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. Discrete Applied Mathematics 60(1-3): 13-23 (1995)
13	EE	Kenneth A. Berman, John V. Franco, John S. Schlipf: Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discrete Applied Mathematics 60(1-3): 77-91 (1995)
12	EE	John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan: On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54(3): 133-137 (1995)
1993
11	EE	John V. Franco: On the Occurrence of Null Clauses in Random Instances of Satisfiability. Discrete Applied Mathematics 41(3): 203-209 (1993)
1992
10		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): 1-15 (1992)
9	EE	Pedro Celis, John V. Franco: The analysis of hashing with lazy deletions. Inf. Sci. 62(1-2): 13-26 (1992)
1991
8		John V. Franco: Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms. SIAM J. Comput. 20(6): 1119-1127 (1991)
1990
7		John V. Franco, Daniel P. Friedman, Steven D. Johnson: Multi-Way Streams in Scheme. Comput. Lang. 15(1): 109-125 (1990)
6		John V. Franco, Daniel P. Friedman: Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. 15(1): 54-64 (1990)
5	EE	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): 289-314 (1990)
4		David S. Wise, John V. Franco: Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distrib. Comput. 9(3): 282-296 (1990)
1989
3		John V. Franco, Daniel P. Friedman: Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. 14(1): 11-23 (1989)
1986
2		John V. Franco: On the Probabilistic Performance of Algorithms for the Satisfiability Problem. Inf. Process. Lett. 23(2): 103-106 (1986)
1		Ming-Te Chao, John V. Franco: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem. SIAM J. Comput. 15(4): 1106-1118 (1986)

Coauthor Index

1	Fred S. Annexstein	[12] [14]
2	Kenneth A. Berman	[13] [15]
3	Pedro Celis	[9]
4	Ming-Te Chao	[1] [5]
5	Nadia Creignou	[26]
6	Hervé Daudé	[26]
7	Michael Dransfield	[22] [24]
8	J. Michael Dunn	[10]
9	Daniel P. Friedman	[3] [6] [7]
10	Allen Van Gelder	[21]
11	Kedar Godbole	[23]
12	Judy Goldsmith	[17]
13	Steven D. Johnson	[7]
14	Michal Kouril	[22] [24] [27]
15	John S. Schlipf	[12] [13] [15] [17] [22] [24] [28]
16	Ewald Speckenmeyer	[17]
17	Ramjee P. Swaminathan	[12] [16] [17] [20]
18	W. Mark Vanfleet	[22] [24]
19	Jeffrey Ward	[22]
20	Sean Weaver	[22] [24] [28]
21	William H. Wheeler	[10]
22	David S. Wise	[4]

Colors in the list of coauthors