Joseph C. Culberson
According to our database1,
Joseph C. Culberson
authored at least 39 papers
between 1985 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
Proceedings of the 40th IEEE Conference on Computer Communications, 2021
2017
Proceedings of the 46th International Conference on Parallel Processing, 2017
2009
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
2008
2007
Proceedings of the Abstraction, 2007
2005
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete.
Discret. Math. Theor. Comput. Sci., 2005
Resolution complexity of random constraint satisfaction problems: Another half of the story.
Discret. Appl. Math., 2005
Discret. Appl. Math., 2005
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
2004
Electron. Colloquium Comput. Complex., 2004
Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness.
Proceedings of the Principles and Practice of Constraint Programming, 2004
2003
Proceedings of the Genetic and Evolutionary Computation, 2003
2002
2001
1998
J. Artif. Intell. Res., 1998
Evol. Comput., 1998
1996
On Searching \alpha-ary Hypercubes and Related Graphs.
Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, 1996
Proceedings of the Advances in Artificial Intelligence, 1996
1995
1994
Evol. Comput., 1994
1993
Crossover versus Mutation: Fueling the Debate: TGA versus GIGA.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993
Proceedings of the Cliques, 1993
Proceedings of the Cliques, 1993
1992
1990
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.
Algorithmica, 1990
1989
J. Comput. Syst. Sci., 1989
Inf. Process. Lett., 1989
Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations.
Comput. J., 1989
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987
1985
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
Proceedings of the First Annual Symposium on Computational Geometry, 1985