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.
Lifelong Planning A∗
2004435 citationsSven Koenig, Maxim Likhachev et al.Artificial Intelligenceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of David Furcy'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 David Furcy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Furcy more than expected).
This network shows the impact of papers produced by David Furcy. 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 David Furcy. The network helps show where David Furcy may publish in the future.
Co-authorship network of co-authors of David Furcy
This figure shows the co-authorship network connecting the top 25 collaborators of David Furcy.
A scholar is included among the top collaborators of David Furcy 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 David Furcy. David Furcy is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Furcy, David, et al.. (2010). Bantam Java compiler project: experiences and extensions. Journal of computing sciences in colleges. 25(6). 159–166.2 indexed citations
8.
Furcy, David. (2009). JHAVEPOP: visualizing linked-list operations in C++ and Java. Journal of computing sciences in colleges. 25(1). 32–41.7 indexed citations
9.
Furcy, David, et al.. (2008). Sorting out sorting. ACM SIGCSE Bulletin. 40(3). 174–178.
10.
Furcy, David, et al.. (2008). Sorting out sorting. 174–178.6 indexed citations
11.
McNally, Myles, et al.. (2007). Supporting the rapid development of pedagogically effective algorithm visualizations. Journal of computing sciences in colleges. 23(1). 80–90.7 indexed citations
Furcy, David & Sven Koenig. (2005). Scaling up WA* with commitment and diversity. International Joint Conference on Artificial Intelligence. 1521–1522.3 indexed citations
14.
Furcy, David & Sven Koenig. (2005). Limited discrepancy beam search. International Joint Conference on Artificial Intelligence. 20(4). 125–131.47 indexed citations
15.
Holte, Robert C., et al.. (2004). Multiple pattern databases. International Conference on Automated Planning and Scheduling. 122–131.25 indexed citations
Furcy, David & Sven Koenig. (2000). Speeding up the Convergence of Real-Time Search. National Conference on Artificial Intelligence. 891–897.31 indexed citations
20.
Furcy, David & Sven Koenig. (2000). Speeding up the Convergence of Real-Time Search: Empirical Setup and Proofs.3 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.