John V. Franco

37 papers A 2B 1Misc 2Journal 28Unranked 3

Year	Rank	Type	Title / Venue / Authors
2022	Misc	`conf`	Auditing a Software-Defined Cross Domain Solution Architecture. CSR Nathan Daughety, Marcus Pendleton, Rebeca Perez, Shouhuai Xu, John V. Franco
2021	—	`conf`	vCDS: A Virtualized Cross Domain Solution Architecture. MILCOM Nathan Daughety, Marcus Pendleton, Shouhuai Xu, Laurent Njilla, John V. Franco
2014	J	`jnl`	Application of constraints to formal verification and artificial intelligence. Ann. Math. Artif. Intell. Miroslav N. Velev, John V. Franco
2011	Misc	`conf`	ID* Lite: improved D* Lite algorithm. SAC Weiya Yue, John V. Franco, Weiwei Cao, Hongwei Yue
2011	J	`jnl`	Preface to the special issue. Ann. Math. Artif. Intell. John V. Franco
2010	J	`jnl`	Improved Complexity Bound of Vertex Cover for Low degree Graph CoRR Weiya Yue, John V. Franco, Weiwei Cao
2006	J	`jnl`	Extending Existential Quantification in Conjunctions of BDDs. J. Satisf. Boolean Model. Comput. Sean A. Weaver, John V. Franco, John S. Schlipf
2005	J	`jnl`	A sharp threshold for the renameable-Horn and the q-Horn properties. Discret. Appl. Math. Nadia Creignou, Hervé Daudé, John V. Franco
2005	A	`conf`	Resolution Tunnels for Improved SAT Solver Performance. SAT Michal Kouril, John V. Franco
2005	J	`jnl`	Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. Discret. Appl. Math. John V. Franco
2004	J	`jnl`	Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. Univers. Comput. Sci. John V. Franco, Michal Kouril, John S. Schlipf, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
2003	—	`conf`	A Java Framework for Collaborative Service Sharing in a P2P Network. PDCS Kedar Godbole, John V. Franco
2003	J	`jnl`	A perspective on certain polynomial-time solvable classes of satisfiability. Discret. Appl. Math. John V. Franco, Allen Van Gelder
2003	J	`jnl`	On good algorithms for determining unsatisfiability of propositional formulas. Discret. Appl. Math. John V. Franco, Ramjee P. Swaminathan
2003	A	`conf`	SBSAT: a State-Based, BDD-Based Satisfiability Solver. SAT John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
2001	J	`jnl`	Results related to threshold phenomena research in satisfiability: lower bounds. Theor. Comput. Sci. John V. Franco
2000	J	`jnl`	Some interesting research directions in satisfiability. Ann. Math. Artif. Intell. John V. Franco
1999	—	`ch.`	Algorithms for the Satisfiability (SAT) Problem. Handbook of Combinatorial Optimization Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah
1999	J	`jnl`	An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
1997	J	`jnl`	Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. Ann. Math. Artif. Intell. John V. Franco, Ramjee P. Swaminathan
1996	—	`conf`	Algorithms for the satisfiability (SAT) problem: A survey. Satisfiability Problem: Theory and Applications Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah
1995	B	`conf`	Computing Well-founded Semantics Faster. LPNMR Kenneth A. Berman, John S. Schlipf, John V. Franco
1995	J	`jnl`	On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
1995	J	`jnl`	Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. Kenneth A. Berman, John V. Franco, John S. Schlipf
1995	J	`jnl`	Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. Discret. Appl. Math. Fred S. Annexstein, John V. Franco
1993	J	`jnl`	On the Occurrence of Null Clauses in Random Instances of Satisfiability. Discret. Appl. Math. John V. Franco
1992	J	`jnl`	Recent Work at the Interface of Logic, Combinatorics and Computer Science. Ann. Math. Artif. Intell. John V. Franco, J. Michael Dunn, William H. Wheeler
1992	J	`jnl`	The analysis of hashing with lazy deletions. Inf. Sci. Pedro Celis, John V. Franco
1991	J	`jnl`	Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms. SIAM J. Comput. John V. Franco
1990	J	`jnl`	Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distributed Comput. David S. Wise, John V. Franco
1990	J	`jnl`	Multi-Way Streams in Scheme. Comput. Lang. John V. Franco, Daniel P. Friedman, Steven D. Johnson
1990	J	`jnl`	Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem. Inf. Sci. Ming-Te Chao, John V. Franco
1990	J	`jnl`	Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. John V. Franco, Daniel P. Friedman
1989	J	`jnl`	Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. John V. Franco, Daniel P. Friedman
1986	J	`jnl`	On the Probabilistic Performance of Algorithms for the Satisfiability Problem. Inf. Process. Lett. John V. Franco
1986	J	`jnl`	Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem. SIAM J. Comput. Ming-Te Chao, John V. Franco
1985	J	`jnl`	Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions. SIGACT News John V. Franco