25,161
edits
Changes
Created page with "'''Home * People * Joe Culberson''' FILE:joeculberson.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/%7Echinook/authors/| Joe Culberson <ref>[..."
'''[[Main Page|Home]] * [[People]] * Joe Culberson'''
[[FILE:joeculberson.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/%7Echinook/authors/| Joe Culberson <ref>[http://webdocs.cs.ualberta.ca/~chinook/authors/ Authors - Chinook]</ref> ]]
'''Joseph C. (Joe) Culberson''',<br/>
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|algorithms]] and [[Data|data structures]].
It includes [https://en.wikipedia.org/wiki/Binary_search_tree binary search trees] <ref>[http://webdocs.cs.ualberta.ca/~joe/Research/binary.html Joseph Culberson's Binary Search Tree Research]</ref>, [https://en.wikipedia.org/wiki/Graph_coloring graph coloring], [[Genetic Programming|genetic algorithms]] <ref>[http://webdocs.cs.ualberta.ca/~joe/research.html Joseph Culberson Research Interests]</ref>, and research on various [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorical] and [https://en.wikipedia.org/wiki/Abstract_strategy_game 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?" <ref>[[Jonathan Schaeffer]] ('''1997, 2009'''). ''[https://www.springer.com/gp/book/9780387765754 One Jump Ahead]''. 1. This Was Going to Be Easy, pp. 5</ref>, yielding in the development of [https://en.wikipedia.org/wiki/Chinook_%28draughts_player%29 Chinook], and solving Checkers <ref>[http://webdocs.cs.ualberta.ca/~chinook/publications/solving_checkers.html Chinook - Solving Checkers]</ref>.
He developed the first version of the Chinook [[Endgame Tablebases|endgame database]] code <ref>[http://webdocs.cs.ualberta.ca/~chinook/authors/ Authors - Chinook]</ref> .
=Selected Publications=
<ref>[http://webdocs.cs.ualberta.ca/~joe/publications.html Joseph Culberson's Publications List]</ref> <ref>[https://dblp.uni-trier.de/pers/c/Culberson:Joseph_C=.html dblp: Joseph C. Culberson]</ref>
==1984 ...==
* [[Joe Culberson]] ('''1984'''). ''[http://webdocs.cs.ualberta.ca/~joe/Abstracts/msc.html Updating Binary Trees]''. M.Sc. thesis, [[University of Waterloo]]
* [[Joe Culberson]] ('''1985'''). ''[https://dl.acm.org/doi/10.1145/22145.22168 The Effect of Updates in Binary Search Trees]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc85.html STOC 1985]
* [[Joe Culberson]] ('''1986'''). ''[http://webdocs.cs.ualberta.ca/~joe/Abstracts/phd.html The Effect of Asymmetric Deletions on Binary Research Trees]''. Ph.D. thesis, [[University of Waterloo]], advisor [[Mathematician#JIMunro|J. Ian Munro]]
* [[Mathematician#RBaezaYates|Ricardo Baeza-Yates]], [[Joe Culberson]], [https://mitpress.mit.edu/contributors/gregory-j-e-rawlins Gregory J. E. Rawlins] ('''1988'''). ''[https://link.springer.com/chapter/10.1007/3-540-19487-8_20 Searching with Uncertainty (Extended Abstract)]''. [https://dblp.uni-trier.de/db/conf/swat/swat88.html SWAT 1988]
* [[Joe Culberson]], [https://dblp.uni-trier.de/pers/r/Rudnicki:Piotr.html Piotr Rudnicki] ('''1989'''). ''[https://kundoc.com/pdf-a-fast-algorithm-for-constructing-trees-from-distance-matrices-.html A Fast Algorithm for Constructing Trees from Distance Matrices]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 30
* [[Joe Culberson]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1989'''). ''[https://www.researchgate.net/publication/220458215_Explaining_the_Behaviour_of_Binary_Search_Trees_Under_Prolonged_Updates_A_Model_and_Simulations Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations]''. [https://en.wikipedia.org/wiki/The_Computer_Journal The Computer Journal], Vol. 32, No. 1
==1990 ...==
* [[Joe Culberson]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1990'''). ''[https://link.springer.com/article/10.1007/BF01840390 Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees]''. [https://en.wikipedia.org/wiki/Algorithmica 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''. [[2nd Computer Olympiad#Workshop|Heuristic Programming in AI 2]]
* [[Jonathan Schaeffer]], [[Joe Culberson]], [[Norman Treloar]], [[Brent Knight]], [[Paul Lu]], [[Duane Szafron]] ('''1992'''). ''A World Championship Caliber Checkers Program''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 53, Nos. 2-3, [http://webdocs.cs.ualberta.ca/~duane/publications/pdf/1992ai.pdf pdf preprint]
* [[Mark Brockington]], [[Joe Culberson]] ('''1993'''). ''[https://www.semanticscholar.org/paper/Camouflaging-independent-sets-in-quasi-random-Brockington-Culberson/5deeb563ef3a06bb96e31d9c480f2ab08f49f303 Camouflaging independent sets in quasi-random graphs]''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html Cliques, Coloring, and Satisfiability 1993]
* [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1996'''). ''Searching with Pattern Databases''. [https://dblp.uni-trier.de/db/conf/ai/ai96.html Canadian Conference on AI 1996],
* [https://github.com/basilv Basil Vandegriend], [[Joe Culberson]] ('''1998'''). ''[https://www.jair.org/index.php/jair/article/view/10213 The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 9, [https://arxiv.org/abs/1105.5443 arXiv:1105.5443]
* [[Joe Culberson]] ('''1998'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/evco.1998.6.2.109?journalCode=evco On the Futility of Blind Search: An Algorithmic View of "No Free Lunch"]''. [https://en.wikipedia.org/wiki/Evolutionary_Computation_(journal) Evolutionary Computation], Vol. 6, No. 2 <ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization | Wikipedia]</ref>
* [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1998'''). ''Pattern databases''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 14, No. 3, [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/Compi_.pdf pdf]
==2000 ...==
* [[Yong Gao]], [[Joe Culberson]] ('''2002'''). ''[https://jair.org/index.php/jair/article/view/10314 An Analysis of Phase Transition in NK Landscapes]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 17, [https://arxiv.org/abs/1106.4575 arXiv:1106.4575] <ref>[https://en.wikipedia.org/wiki/NK_model NK model from Wikipedia]</ref>
* [[Yong Gao]], [[Joe Culberson]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-30201-8_5 Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness]''. [https://dblp.uni-trier.de/db/conf/cp/cp2004.html CP 2004] <ref>[https://en.wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem from Wikipedia]</ref>
* [[Yong Gao]], [[Joe Culberson]] ('''2007'''). ''Consistency and Random Constraint Satisfaction Models''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 28, [https://arxiv.org/abs/1110.2204 arXiv:1110.2204]
* [[Fan Yang]], [[Joe Culberson]], [[Robert Holte]], [[Uzi Zahavi]], [[Ariel Felner]] ('''2008'''). ''A General Theory of Additive State Space Abstractions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 32, [https://arxiv.org/abs/1111.0067 arXiv:1111.0067]
=External Links=
* [http://webdocs.cs.ualberta.ca/%7Ejoe/ Joseph (Joe) Culberson Professor]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=310 Joe Culberson's ICGA Tournaments]
* [http://webdocs.cs.ualberta.ca/%7Ejoe/Coloring/ Joseph Culberson's Graph Coloring Resources Page]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=67018 Joseph Culberson - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Culberson]]
[[Category:Checkers Programmer|Culberson]]
[[FILE:joeculberson.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/%7Echinook/authors/| Joe Culberson <ref>[http://webdocs.cs.ualberta.ca/~chinook/authors/ Authors - Chinook]</ref> ]]
'''Joseph C. (Joe) Culberson''',<br/>
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|algorithms]] and [[Data|data structures]].
It includes [https://en.wikipedia.org/wiki/Binary_search_tree binary search trees] <ref>[http://webdocs.cs.ualberta.ca/~joe/Research/binary.html Joseph Culberson's Binary Search Tree Research]</ref>, [https://en.wikipedia.org/wiki/Graph_coloring graph coloring], [[Genetic Programming|genetic algorithms]] <ref>[http://webdocs.cs.ualberta.ca/~joe/research.html Joseph Culberson Research Interests]</ref>, and research on various [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorical] and [https://en.wikipedia.org/wiki/Abstract_strategy_game 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?" <ref>[[Jonathan Schaeffer]] ('''1997, 2009'''). ''[https://www.springer.com/gp/book/9780387765754 One Jump Ahead]''. 1. This Was Going to Be Easy, pp. 5</ref>, yielding in the development of [https://en.wikipedia.org/wiki/Chinook_%28draughts_player%29 Chinook], and solving Checkers <ref>[http://webdocs.cs.ualberta.ca/~chinook/publications/solving_checkers.html Chinook - Solving Checkers]</ref>.
He developed the first version of the Chinook [[Endgame Tablebases|endgame database]] code <ref>[http://webdocs.cs.ualberta.ca/~chinook/authors/ Authors - Chinook]</ref> .
=Selected Publications=
<ref>[http://webdocs.cs.ualberta.ca/~joe/publications.html Joseph Culberson's Publications List]</ref> <ref>[https://dblp.uni-trier.de/pers/c/Culberson:Joseph_C=.html dblp: Joseph C. Culberson]</ref>
==1984 ...==
* [[Joe Culberson]] ('''1984'''). ''[http://webdocs.cs.ualberta.ca/~joe/Abstracts/msc.html Updating Binary Trees]''. M.Sc. thesis, [[University of Waterloo]]
* [[Joe Culberson]] ('''1985'''). ''[https://dl.acm.org/doi/10.1145/22145.22168 The Effect of Updates in Binary Search Trees]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc85.html STOC 1985]
* [[Joe Culberson]] ('''1986'''). ''[http://webdocs.cs.ualberta.ca/~joe/Abstracts/phd.html The Effect of Asymmetric Deletions on Binary Research Trees]''. Ph.D. thesis, [[University of Waterloo]], advisor [[Mathematician#JIMunro|J. Ian Munro]]
* [[Mathematician#RBaezaYates|Ricardo Baeza-Yates]], [[Joe Culberson]], [https://mitpress.mit.edu/contributors/gregory-j-e-rawlins Gregory J. E. Rawlins] ('''1988'''). ''[https://link.springer.com/chapter/10.1007/3-540-19487-8_20 Searching with Uncertainty (Extended Abstract)]''. [https://dblp.uni-trier.de/db/conf/swat/swat88.html SWAT 1988]
* [[Joe Culberson]], [https://dblp.uni-trier.de/pers/r/Rudnicki:Piotr.html Piotr Rudnicki] ('''1989'''). ''[https://kundoc.com/pdf-a-fast-algorithm-for-constructing-trees-from-distance-matrices-.html A Fast Algorithm for Constructing Trees from Distance Matrices]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 30
* [[Joe Culberson]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1989'''). ''[https://www.researchgate.net/publication/220458215_Explaining_the_Behaviour_of_Binary_Search_Trees_Under_Prolonged_Updates_A_Model_and_Simulations Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations]''. [https://en.wikipedia.org/wiki/The_Computer_Journal The Computer Journal], Vol. 32, No. 1
==1990 ...==
* [[Joe Culberson]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1990'''). ''[https://link.springer.com/article/10.1007/BF01840390 Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees]''. [https://en.wikipedia.org/wiki/Algorithmica 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''. [[2nd Computer Olympiad#Workshop|Heuristic Programming in AI 2]]
* [[Jonathan Schaeffer]], [[Joe Culberson]], [[Norman Treloar]], [[Brent Knight]], [[Paul Lu]], [[Duane Szafron]] ('''1992'''). ''A World Championship Caliber Checkers Program''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 53, Nos. 2-3, [http://webdocs.cs.ualberta.ca/~duane/publications/pdf/1992ai.pdf pdf preprint]
* [[Mark Brockington]], [[Joe Culberson]] ('''1993'''). ''[https://www.semanticscholar.org/paper/Camouflaging-independent-sets-in-quasi-random-Brockington-Culberson/5deeb563ef3a06bb96e31d9c480f2ab08f49f303 Camouflaging independent sets in quasi-random graphs]''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html Cliques, Coloring, and Satisfiability 1993]
* [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1996'''). ''Searching with Pattern Databases''. [https://dblp.uni-trier.de/db/conf/ai/ai96.html Canadian Conference on AI 1996],
* [https://github.com/basilv Basil Vandegriend], [[Joe Culberson]] ('''1998'''). ''[https://www.jair.org/index.php/jair/article/view/10213 The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 9, [https://arxiv.org/abs/1105.5443 arXiv:1105.5443]
* [[Joe Culberson]] ('''1998'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/evco.1998.6.2.109?journalCode=evco On the Futility of Blind Search: An Algorithmic View of "No Free Lunch"]''. [https://en.wikipedia.org/wiki/Evolutionary_Computation_(journal) Evolutionary Computation], Vol. 6, No. 2 <ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization | Wikipedia]</ref>
* [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1998'''). ''Pattern databases''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 14, No. 3, [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/Compi_.pdf pdf]
==2000 ...==
* [[Yong Gao]], [[Joe Culberson]] ('''2002'''). ''[https://jair.org/index.php/jair/article/view/10314 An Analysis of Phase Transition in NK Landscapes]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 17, [https://arxiv.org/abs/1106.4575 arXiv:1106.4575] <ref>[https://en.wikipedia.org/wiki/NK_model NK model from Wikipedia]</ref>
* [[Yong Gao]], [[Joe Culberson]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-30201-8_5 Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness]''. [https://dblp.uni-trier.de/db/conf/cp/cp2004.html CP 2004] <ref>[https://en.wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem from Wikipedia]</ref>
* [[Yong Gao]], [[Joe Culberson]] ('''2007'''). ''Consistency and Random Constraint Satisfaction Models''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 28, [https://arxiv.org/abs/1110.2204 arXiv:1110.2204]
* [[Fan Yang]], [[Joe Culberson]], [[Robert Holte]], [[Uzi Zahavi]], [[Ariel Felner]] ('''2008'''). ''A General Theory of Additive State Space Abstractions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 32, [https://arxiv.org/abs/1111.0067 arXiv:1111.0067]
=External Links=
* [http://webdocs.cs.ualberta.ca/%7Ejoe/ Joseph (Joe) Culberson Professor]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=310 Joe Culberson's ICGA Tournaments]
* [http://webdocs.cs.ualberta.ca/%7Ejoe/Coloring/ Joseph Culberson's Graph Coloring Resources Page]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=67018 Joseph Culberson - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Culberson]]
[[Category:Checkers Programmer|Culberson]]
