Joe Culberson

Home * People * Joe Culberson



Joseph C. (Joe) Culberson, a Canadian computer scientist, and professor at the Department of Computing Science, University of Alberta. His research interests tends to be a mixture of theoretical analysis and experimental simulation of algorithms and data structures. It includes binary search trees, graph coloring, genetic algorithms , and research on various combinatorical and abstract strategy games, such as Sokoban and Checkers. In winter 1988, Joe Culberson and Duane Szafron asked Jonathan Schaeffer the innocent question "Jonathan, what ever happened to computer checkers?" , yielding in the development of Chinook, and solving Checkers. He developed the first version of the Chinook endgame database code.

=Selected Publications=

1984 ...

 * Joe Culberson (1984). Updating Binary Trees. M.Sc. thesis, University of Waterloo
 * Joe Culberson (1985). The Effect of Updates in Binary Search Trees. STOC 1985
 * Joe Culberson (1986). The Effect of Asymmetric Deletions on Binary Research Trees. Ph.D. thesis, University of Waterloo, advisor J. Ian Munro
 * Ricardo Baeza-Yates, Joe Culberson, Gregory J. E. Rawlins (1988). Searching with Uncertainty (Extended Abstract). SWAT 1988
 * Joe Culberson, Piotr Rudnicki (1989). A Fast Algorithm for Constructing Trees from Distance Matrices. Information Processing Letters, Vol. 30
 * Joe Culberson, J. Ian Munro (1989). Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. The Computer Journal, Vol. 32, No. 1

1990 ...

 * Joe Culberson, J. Ian Munro (1990). Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. Algorithmica, Vol. 5, No. 3
 * Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1991). Checkers Program to Challenge for World Championship. SIGART Bulletin, Vol. 2, No. 2
 * Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1991). Reviving the Game of Checkers. Heuristic Programming in AI 2
 * Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1992). A World Championship Caliber Checkers Program. Artificial Intelligence, Vol. 53, Nos. 2-3, pdf preprint
 * Mark Brockington, Joe Culberson (1993). Camouflaging independent sets in quasi-random graphs. Cliques, Coloring, and Satisfiability 1993
 * Joe Culberson, Jonathan Schaeffer (1996). Searching with Pattern Databases. Canadian Conference on AI 1996,
 * Basil Vandegriend, Joe Culberson (1998). The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. JAIR, Vol. 9, arXiv:1105.5443
 * Joe Culberson (1998). On the Futility of Blind Search: An Algorithmic View of "No Free Lunch". Evolutionary Computation, Vol. 6, No. 2
 * Joe Culberson, Jonathan Schaeffer (1998). Pattern databases. Computational Intelligence, Vol. 14, No. 3, pdf

2000 ...

 * Yong Gao, Joe Culberson (2002). An Analysis of Phase Transition in NK Landscapes. JAIR, Vol. 17, arXiv:1106.4575
 * Yong Gao, Joe Culberson (2004). Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. CP 2004
 * Yong Gao, Joe Culberson (2007). Consistency and Random Constraint Satisfaction Models. JAIR, Vol. 28, arXiv:1110.2204
 * Fan Yang, Joe Culberson, Robert Holte, Uzi Zahavi, Ariel Felner (2008). A General Theory of Additive State Space Abstractions. JAIR, Vol. 32, arXiv:1111.0067

=External Links=
 * Joseph (Joe) Culberson Professor
 * Joe Culberson's ICGA Tournaments
 * Joseph Culberson's Graph Coloring Resources Page
 * Joseph Culberson - The Mathematics Genealogy Project

=References= Up one level