John V. Franco
Affiliations: University of Cincinnati, USA
According to our database^{1},
John V. Franco
authored at least 37 papers
between 1985 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on ececs.uc.edu
On csauthors.net:
Bibliography
2022
Proceedings of the IEEE International Conference on Cyber Security and Resilience, 2022
2021
Proceedings of the 2021 IEEE Military Communications Conference, 2021
2014
Ann. Math. Artif. Intell., 2014
2011
Ann. Math. Artif. Intell., 2011
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011
2010
CoRR, 2010
2006
J. Satisf. Boolean Model. Comput., 2006
2005
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon.
Discret. Appl. Math., 2005
Discret. Appl. Math., 2005
Proceedings of the Theory and Applications of Satisfiability Testing, 2005
2004
J. Univers. Comput. Sci., 2004
2003
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
Proceedings of the Theory and Applications of Satisfiability Testing, 2003
A Java Framework for Collaborative Service Sharing in a P2P Network.
Proceedings of the ISCA 16th International Conference on Parallel and Distributed Computing Systems, 2003
2001
Theor. Comput. Sci., 2001
2000
Ann. Math. Artif. Intell., 2000
1999
Discret. Appl. Math., 1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
1997
Average Case Results for Satisfiability Algorithms Under the RandomClauseWidth Model.
Ann. Math. Artif. Intell., 1997
1996
Proceedings of the Satisfiability Problem: Theory and Applications, 1996
1995
Inf. Process. Lett., 1995
Discret. Appl. Math., 1995
Workpreserving Emulations of Shuffleexchange Networks: An Analysis of the Complex Plane Diagram.
Discret. Appl. Math., 1995
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995
1993
Discret. Appl. Math., 1993
1992
Inf. Sci., 1992
Ann. Math. Artif. Intell., 1992
1991
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms.
SIAM J. Comput., 1991
1990
J. Parallel Distributed Comput., 1990
Probabilistic analysis of a generalization of the unitclause literal selection heuristics for the k satisfiability problem.
Inf. Sci., 1990
Comput. Lang., 1990
Comput. Lang., 1990
1989
Comput. Lang., 1989
1986
SIAM J. Comput., 1986
Inf. Process. Lett., 1986
1985
Sensitivity of probabilistic results on algorithms for NPcomplete problems to input distributions.
SIGACT News, 1985