The SCEAS System
| |||||||

## Search the dblp DataBase
John V. Franco:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kedar Godbole, John V. Franco
**A Java Framework for Collaborative Service Sharing in a P2P Network.**[Citation Graph (0, 0)][DBLP] ISCA PDCS, 2003, pp:105-111 [Conf] - Kenneth A. Berman, John S. Schlipf, John V. Franco
**Computing Well-founded Semantics Faster.**[Citation Graph (0, 0)][DBLP] LPNMR, 1995, pp:113-126 [Conf] - Michal Kouril, John V. Franco
**Resolution Tunnels for Improved SAT Solver Performance.**[Citation Graph (0, 0)][DBLP] SAT, 2005, pp:143-157 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SAT, 2003, pp:398-410 [Conf] - John V. Franco
**Some interesting research directions in satisfiability.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2000, v:28, n:1-4, pp:7-15 [Journal] - John V. Franco, J. Michael Dunn, William H. Wheeler
**Recent Work at the Interface of Logic, Combinatorics and Computer Science.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1992, v:6, n:1-3, pp:1-15 [Journal] - John V. Franco, Ramjee P. Swaminathan
**Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1997, v:20, n:1-4, pp:357-391 [Journal] - John V. Franco, Daniel P. Friedman
**Creating Efficient Programs by Exchanging Data for Procedures.**[Citation Graph (0, 0)][DBLP] Comput. Lang., 1989, v:14, n:1, pp:11-23 [Journal] - John V. Franco, Daniel P. Friedman
**Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme.**[Citation Graph (0, 0)][DBLP] Comput. Lang., 1990, v:15, n:1, pp:54-64 [Journal] - John V. Franco, Daniel P. Friedman, Steven D. Johnson
**Multi-Way Streams in Scheme.**[Citation Graph (0, 0)][DBLP] Comput. Lang., 1990, v:15, n:1, pp:109-125 [Journal] - Fred S. Annexstein, John V. Franco
**Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:13-23 [Journal] - Kenneth A. Berman, John V. Franco, John S. Schlipf
**Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:77-91 [Journal] - Nadia Creignou, Hervé Daudé, John V. Franco
**A sharp threshold for the renameable-Horn and the q-Horn properties.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:48-57 [Journal] - John V. Franco
**Typical case complexity of Satisfiability Algorithms and the threshold phenomenon.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:89-123 [Journal] - John V. Franco
**On the Occurrence of Null Clauses in Random Instances of Satisfiability.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:41, n:3, pp:203-209 [Journal] - John V. Franco, Allen Van Gelder
**A perspective on certain polynomial-time solvable classes of satisfiability.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:125, n:2-3, pp:177-214 [Journal] - John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
**An Algorithm for the Class of Pure Implicational Formulas.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:89-106 [Journal] - John V. Franco, Ramjee P. Swaminathan
**On good algorithms for determining unsatisfiability of propositional formulas.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:129-138 [Journal] - John V. Franco
**On the Probabilistic Performance of Algorithms for the Satisfiability Problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:23, n:2, pp:103-106 [Journal] - John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
**On Finding Solutions for Extended Horn Formulas.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:54, n:3, pp:133-137 [Journal] - Pedro Celis, John V. Franco
**The analysis of hashing with lazy deletions.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1992, v:62, n:1-2, pp:13-26 [Journal] - Ming-Te Chao, John V. Franco
**Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1990, v:51, n:3, pp:289-314 [Journal] - David S. Wise, John V. Franco
**Costs of Quadtree Representation of Nondense Matrices.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1990, v:9, n:3, pp:282-296 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. UCS, 2004, v:10, n:12, pp:1655-1695 [Journal] - Ming-Te Chao, John V. Franco
**Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:4, pp:1106-1118 [Journal] - John V. Franco
**Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:6, pp:1119-1127 [Journal] - John V. Franco
**Results related to threshold phenomena research in satisfiability: lower bounds.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:265, n:1-2, pp:147-157 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |