The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Joseph C. Culberson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joseph C. Culberson, Jonathan Schaeffer
    Searching with Pattern Databases. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 1996, pp:402-416 [Conf]
  2. Robert A. Reckhow, Joseph C. Culberson
    Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:268-277 [Conf]
  3. Yong Gao, Joseph C. Culberson
    Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:17-31 [Conf]
  4. Joseph C. Culberson, Robert A. Reckhow
    Covering Polygons Is Hard (Preliminary Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:601-611 [Conf]
  5. Joseph C. Culberson, Jonathan Lichtner
    On Searching \alpha-ary Hypercubes and Related Graphs. [Citation Graph (0, 0)][DBLP]
    FOGA, 1996, pp:263-290 [Conf]
  6. Yong Gao, Joseph C. Culberson
    On the Treewidth of NK Landscapes. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:948-954 [Conf]
  7. Joseph C. Culberson
    Crossover versus Mutation: Fueling the Debate: TGA versus GIGA. [Citation Graph (0, 0)][DBLP]
    ICGA, 1993, pp:632- [Conf]
  8. Joseph C. Culberson, Yong Gao, Calin Anton
    Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:78-83 [Conf]
  9. Joseph C. Culberson
    The Effect of Updates in Binary Search Trees [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:205-212 [Conf]
  10. Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins
    Searching with Uncertainty (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:176-189 [Conf]
  11. Jonathan Schaeffer, Joseph C. Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron
    A World Championship Caliber Checkers Program. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:53, n:2-3, pp:273-289 [Journal]
  12. Joseph C. Culberson, J. Ian Munro
    Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:3, pp:295-311 [Journal]
  13. Joseph C. Culberson, J. Ian Munro
    Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:68-75 [Journal]
  14. Adam Beacham, Joseph C. Culberson
    On the complexity of unfrozen problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:3-24 [Journal]
  15. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
    The resolution complexity of random graph k-colorability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:25-47 [Journal]
  16. Yong Gao, Joseph C. Culberson
    Resolution complexity of random constraint satisfaction problems: Another half of the story. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:124-140 [Journal]
  17. Joseph C. Culberson
    Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 1994, v:2, n:3, pp:279-311 [Journal]
  18. Joseph C. Culberson
    On the Futility of Blind Search: An Algorithmic View of ``No Free Lunch''. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 1998, v:6, n:2, pp:109-127 [Journal]
  19. Yong Gao, Joseph C. Culberson
    Space Complexity of Estimation of Distribution Algorithms. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 2005, v:13, n:1, pp:125-143 [Journal]
  20. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
    The Resolution Complexity of Random Graph k-Colorability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:012, pp:- [Journal]
  21. Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins
    Searching in the Plane [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:106, n:2, pp:234-252 [Journal]
  22. Joseph C. Culberson, Piotr Rudnicki
    A Fast Algorithm for Constructing Trees from Distance Matrices. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:4, pp:215-220 [Journal]
  23. Yong Gao, Joseph C. Culberson
    An Analysis of Phase Transition in NK Landscapes. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2002, v:17, n:, pp:309-332 [Journal]
  24. Basil Vandegriend, Joseph C. Culberson
    The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1998, v:9, n:, pp:219-245 [Journal]
  25. Joseph C. Culberson, Robert A. Reckhow
    Covering Polygons Is Hard. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:1, pp:2-44 [Journal]
  26. Joseph C. Culberson, Robert A. Reckhow
    Orthogonally Convex Coverings of Orthogonal Polygons without Holes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:2, pp:166-204 [Journal]
  27. Joseph C. Culberson, Ian P. Gent
    Frozen development in graph coloring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:227-264 [Journal]
  28. Fan Yang, Joseph C. Culberson, Robert Holte
    Using Infeasibility to Improve Abstraction-Based Heuristics. [Citation Graph (0, 0)][DBLP]
    SARA, 2007, pp:413-414 [Conf]
  29. Nesrine Abbas, Joseph C. Culberson, Lorna Stewart
    Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:141-154 [Journal]
  30. Yong Gao, Joseph C. Culberson
    Consistency and Random Constraint Satisfaction Models. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2007, v:28, n:, pp:517-557 [Journal]

  31. Turtlegons: generating simple polygons for sequences of angles. [Citation Graph (, )][DBLP]


  32. DP-Complete Problems Derived from Extremal NP-Complete Properties. [Citation Graph (, )][DBLP]


  33. Pattern Databases. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002