Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Depth-first iterative-deepening
1985994 citationsRichard E. KorfArtificial Intelligenceprofile →
Real-time heuristic search
1990602 citationsRichard E. KorfArtificial Intelligenceprofile →
Citations per year, relative to Richard E. Korf Richard E. Korf (= 1×)
peers
Thomas Dean
Countries citing papers authored by Richard E. Korf
Since
Specialization
Citations
This map shows the geographic impact of Richard E. Korf's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Richard E. Korf with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Richard E. Korf more than expected).
This network shows the impact of papers produced by Richard E. Korf. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Richard E. Korf. The network helps show where Richard E. Korf may publish in the future.
Co-authorship network of co-authors of Richard E. Korf
This figure shows the co-authorship network connecting the top 25 collaborators of Richard E. Korf.
A scholar is included among the top collaborators of Richard E. Korf based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Richard E. Korf. Richard E. Korf is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Korf, Richard E., et al.. (2014). Optimal Sequential Multi-Way Number Partitioning..8 indexed citations
2.
Korf, Richard E., et al.. (2013). Improved bin completion for optimal bin packing and number partitioning. International Joint Conference on Artificial Intelligence. 651–658.15 indexed citations
3.
Korf, Richard E., et al.. (2008). Best-First Search with Maximum Edge Cost Functions..1 indexed citations
4.
Korf, Richard E., Michael F. Reid, & Stefan Edelkamp. (2001). Time complexity of iterative-deepening-A∗. Artificial Intelligence. 129(1-2). 199–218.98 indexed citations
5.
Sturtevant, Nathan & Richard E. Korf. (2000). On Pruning Techniques for Multi-Player Games. National Conference on Artificial Intelligence. 201–207.36 indexed citations
6.
Korf, Richard E.. (2000). Recent Progress in the Design and Analysis of Admissible Heuristic Functions. National Conference on Artificial Intelligence. 1165–1170.1 indexed citations
7.
Korf, Richard E. & Weixiong Zhang. (2000). Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment. National Conference on Artificial Intelligence. 910–916.50 indexed citations
8.
Korf, Richard E.. (1999). SLIDING-TILE PUZZLES AND RUBIK'S CUBE IN AL RESEARCH. IEEE Intelligent Systems and their Applications. 14(6). 8–12.5 indexed citations
9.
Edelkamp, Stefan & Richard E. Korf. (1998). The branching factor of regular search spaces. FreiDok plus (Universitätsbibliothek Freiburg). 299–304.6 indexed citations
Korf, Richard E. & David Maxwell Chickering. (1993). Best-First Minimax Search: First Results. National Conference on Artificial Intelligence.4 indexed citations
12.
Korf, Richard E., et al.. (1991). Depth-First Versus Best-First Search.. National Conference on Artificial Intelligence. 434–440.8 indexed citations
13.
Kumar, Vipin, et al.. (1991). Depth-first vs best-first search. National Conference on Artificial Intelligence. 434–440.37 indexed citations
Korf, Richard E.. (1988). Real-time heuristic search: new results. National Conference on Artificial Intelligence. 139–144.36 indexed citations
16.
Abramson, Bruce & Richard E. Korf. (1987). A model of two-player evaluation punctions. National Conference on Artificial Intelligence. 90–94.7 indexed citations
17.
Korf, Richard E.. (1983). Learning to solve problems by searching for macro-operators.69 indexed citations
18.
Korf, Richard E.. (1983). Operator decomposab1lity: a new type of problem structure. National Conference on Artificial Intelligence. 206–209.5 indexed citations
19.
Korf, Richard E.. (1982). A program that learns to solve rubik's cube. National Conference on Artificial Intelligence. 164–167.16 indexed citations
20.
Korf, Richard E.. (1981). Inversion of applicative programs. International Joint Conference on Artificial Intelligence. 1007–1009.18 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.