Revision as of 13:05, 9 June 2018

Home * People * Richard Korf

Richard Korf ^[1]

Richard Earl Korf,
an American computer scientist at the University of California, Los Angeles. He received his B.S. from MIT in 1977, and his M.S. and Ph.D. from Carnegie Mellon University in 1980 and 1983. His research is in the areas of problem-solving, heuristic search, and planning in artificial intelligence.

Selected Publications

Richard Korf (1984). The Complexity of Brute Force Search. Technical Report, Department of Computer Science, Columbia University ^[5]
Richard Korf (1985). Depth-first Iterative-Deepening: An Optimal Admissible Tree Search. pdf
Richard Korf (1985). Learning to solve problems by searching for macro-operators. Pitman.
Richard Korf (1985). Macro-operators: A weak method for learning. Artificial Intelligence, Vol. 26, No. 1
Jens Christensen, Richard Korf (1986). A Unified Theory of Heuristic Evaluation functions and Its Applications to Learning. AAAI-86, pdf.
Richard Korf (1987). Planning as Search: A Quantitative Approach. Artificial Intelligence, Vol. 33, pp. 65-88.
Bruce Abramson, Richard Korf (1987). A Model of Two-Player Evaluation Functions. AAAI-87. pdf
Chris Ferguson, Richard Korf (1988). Distributed Tree Search and its Application to Alpha-Beta Pruning. AAAI-88, pdf

Richard Korf (2000). Finding Optimal Solution to Rubik’s Cube Using Pattern Databases. Games in AI Research (eds. Jaap van den Herik and Hiroyuki Iida), Universiteit Maastricht
Nathan Sturtevant, Richard Korf (2000). On Pruning Techniques for Multi-Player Games. AAAI-2000, pdf
Richard Korf, Ariel Felner (2002). Disjoint Pattern Database Heuristics. in “Chips Challenging Champions: Games, Computers and Artificial Intelligence”, edited by Jonathan Schaeffer and Jaap van den Herik. Elsevier Science
Ariel Felner, Richard Korf, Ram Meshulam, Robert Holte (2007). Compressed Pattern Databases. JAIR, Vol. 30, pdf
Richard Korf, Ariel Felner (2007). Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. IJCAI-07
Richard Korf (2008). Minimizing Disk I/O in Two-Bit Breadth-First Search. AAAI-2008, pdf

@@ Line 39: / Line 39: @@
 * [https://dblp.uni-trier.de/pers/hd/b/Barker:Joseph_Kelly Joseph K. Barker], [[Richard Korf]] ('''2012'''). ''[https://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5126 Solving Dots-And-Boxes]''. [[Conferences#AAAI-2012|AAAI-2012]]
 * [[Richard Korf]] ('''2012'''). ''[https://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5094 Research Challenges in Combinatorial Search]''. [[Conferences#AAAI-2012|AAAI-2012]]
-* [[Richard Korf]] ('''2014'''). ''How Do You Know Your Search Algorithm and Code Are Correct''? [https://dblp.uni-trier.de/db/conf/socs/socs2014.html SOCS 2014], [https://pdfs.semanticscholar.org/5e16/e98074048f73a0db2b25669a8fbdb69048ba.pdfpdf]
+* [[Richard Korf]] ('''2014'''). ''How Do You Know Your Search Algorithm and Code Are Correct''? [https://dblp.uni-trier.de/db/conf/socs/socs2014.html SOCS 2014], [https://pdfs.semanticscholar.org/5e16/e98074048f73a0db2b25669a8fbdb69048ba.pdf pdf]
-* [[Richard Korf]] ('''2016'''). ''Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory''. [[Conferences#IJCAI2016|IJCAI 2016]]
+* [[Richard Korf]] ('''2016'''). ''Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory''. [[Conferences#IJCAI2016|IJCAI 2016]], [https://pdfs.semanticscholar.org/d9b5/ca0e84ebf8566c34cf218aba1789af6d3111.pdf pdf]
 =External Links=