2026 Richard E. Korf: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	57	3842	3734	1822	1756	146	13065

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

3842

3734

1822

1756

146

13065

Research.com Recognitions

1994 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For contributions to the development and analysis of heuristic search methods.

Overview

Richard E. Korf is affiliated with the University of California, Los Angeles in the United States. Their research primarily spans the field of Computer Science with a particular focus on Artificial Intelligence.

The scientist's work covers several subfields of study, including:

Artificial Intelligence
Computer Networks and Communications
Signal Processing
Computer Vision and Pattern Recognition
Industrial and Manufacturing Engineering

Key topics addressed in their research include:

AI-based Problem Solving and Planning
Constraint Satisfaction and Optimization
Data Management and Algorithms
Artificial Intelligence in Games
Robotic Path Planning Algorithms
Advanced Database Systems and Queries
Optimization and Search Problems

Richard E. Korf has contributed to multiple publication venues, with the most frequent being:

Proceedings of the International Symposium on Combinatorial Search
Proceedings of the AAAI Conference on Artificial Intelligence
American Mathematical Monthly
arXiv (Cornell University)

Their recent published papers include:

"Research Challenges in Combinatorial Search", 2021, Proceedings of the AAAI Conference on Artificial Intelligence
"A*+BFHS: A Hybrid Heuristic Search Algorithm", 2022, Proceedings of the AAAI Conference on Artificial Intelligence
"Solving Peg Solitaire with Bidirectional BFIDA*", 2021, Proceedings of the AAAI Conference on Artificial Intelligence
"Solving Dots-And-Boxes", 2021, Proceedings of the AAAI Conference on Artificial Intelligence
"Optimal Packing of High-Precision Rectangles", 2021, Proceedings of the International Symposium on Combinatorial Search

Frequent collaborators in their work include:

Zhaoxing Bu
Joseph Barker
Eric Huang
Daniel Borrajo
Ariel Felner

In 1994, Richard E. Korf was recognized as a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) for contributions to the development and analysis of heuristic search methods.

Best Publications

Depth-first iterative-deepening: an optimal admissible tree search

Richard E. Korf

2696
Citations
Real-time heuristic search

Richard E. Korf

1392
Citations
Planning as search: a quantitative approach

Richard E. Korf

629
Citations
Linear-space best-first search

Richard E. Korf

481
Citations
Macro-operators: a weak method for learning

Richard E. Korf

442
Citations
Finding optimal solutions to Rubik's cube using pattern databases

Richard E. Korf

398
Citations
Disjoint pattern database heuristics

Richard E. Korf;Ariel Felner

278
Citations
A complete anytime algorithm for number partitioning

Richard E. Korf

249
Citations
Additive pattern database heuristics

Ariel Felner;Richard E. Korf;Sarit Hanan

229
Citations
Time complexity of iterative-deepening-A

Richard E. Korf;Michael Reid;Stefan Edelkamp

206
Citations
Complete algorithms for cooperative pathfinding problems

Trevor Standley;Richard Korf

200
Citations
Moving target search

Toru Ishida;Richard E. Korf

198
Citations
Learning to solve problems by searching for macro-operators

Richard Earl Korf

195
Citations
Artificial intelligence search algorithms

Richard E. Korf

186
Citations
Toward a model of representation changes

Richard E. Korf

185
Citations
Improved limited discrepancy search

Richard E. Korf

175
Citations
A new algorithm for optimal bin packing

Richard E. Korf

172
Citations
Finding optimal solutions to the twenty-four puzzle

Richard E. Korf;Larry A. Taylor

159
Citations
Iterative-deepening-A: an optimal admissible tree search

Richard E. Korf

157
Citations
Large-scale parallel breadth-first search

Richard E. Korf;Peter Schultze

153
Citations

Frequent Co-Authors

Ariel Felner Ben-Gurion University of the Negev

David Maxwell Chickering Microsoft (United States)

Nathan R. Sturtevant University of Alberta

Barbara Hayes-Roth RAND Corporation

Robert C. Holte University of Alberta

Stefan Edelkamp Charles University

Vipin Kumar University of Minnesota

Judea Pearl University of California, Los Angeles

Rina Dechter University of California, Irvine

Toru Ishida Hong Kong Baptist University

External Links

Personal website of Richard E. Korf Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees is a flexible way to build your career in computer science or related fields. Many students start with an associate degree in 6 months online, which provides foundational knowledge and can often lead directly to entry-level tech roles or further studies.

For those interested in a broader skill set, online business degree programs offer valuable insights into management and entrepreneurship—ideal for students looking to bridge technology and business.

Accelerated options are also available at the graduate level. The fastest edd program online can help educators and professionals in computer science advance their expertise in a short time. If you aim to reach the highest academic level affordably, consider reviewing cheap phd programs online.

Each pathway offers unique benefits and career opportunities. Whether you’re seeking speed, affordability, or a new direction, there’s an online degree that can support your professional journey in tech and beyond.