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.
Bayesian Artificial Intelligence
2003757 citationsKevin B. Korb, Ann E. Nicholsonprofile →
Bayesian Artificial Intelligence
2010536 citationsKevin B. Korb, Ann E. Nicholsonprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Ann E. Nicholson
Since
Specialization
Citations
This map shows the geographic impact of Ann E. Nicholson'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 Ann E. Nicholson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ann E. Nicholson more than expected).
Fields of papers citing papers by Ann E. Nicholson
This network shows the impact of papers produced by Ann E. Nicholson. 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 Ann E. Nicholson. The network helps show where Ann E. Nicholson may publish in the future.
Co-authorship network of co-authors of Ann E. Nicholson
This figure shows the co-authorship network connecting the top 25 collaborators of Ann E. Nicholson.
A scholar is included among the top collaborators of Ann E. Nicholson 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 Ann E. Nicholson. Ann E. Nicholson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Woodberry, Owen, Kevin B. Korb, & Ann E. Nicholson. (2007). A simulation study of the evolution of ageing. Evolutionary ecology research. 9(7). 1077–1096.4 indexed citations
9.
Twardy, Charles, Ann E. Nicholson, Kevin B. Korb, & John J. McNeil. (2006). Epidemiological data mining of cardiovascular Bayesian networks. 1(1). 3.19 indexed citations
10.
Woodberry, Owen, Kevin B. Korb, & Ann E. Nicholson. (2005). The Evolution of Aging. 319–333.2 indexed citations
11.
Albrecht, David, et al.. (2001). Information-Theoretic Advisors in Invisible Chess. International Conference on Artificial Intelligence and Statistics. 29–34.
12.
Albrecht, David, et al.. (2001). Playing "invisible chess" with information-theoretic advisors. National Conference on Artificial Intelligence. 6–15.2 indexed citations
13.
Zukerman, Ingrid, et al.. (2000). Trading Off Granularity against Complexity.. 241–251.1 indexed citations
14.
Korb, Kevin B., et al.. (1999). Bayesian poker. Uncertainty in Artificial Intelligence. 343–350.34 indexed citations
15.
Albrecht, David, Ingrid Zukerman, & Ann E. Nicholson. (1999). Pre-sending documents on the WWW: a comparative study. International Joint Conference on Artificial Intelligence. 1274–1279.34 indexed citations
16.
Nicholson, Ann E., et al.. (1998). Using Mutual Information to determine Relevance in Bayesian Networks.7 indexed citations
17.
Nicholson, Ann E., et al.. (1997). A best-first search method for anytime evaluation of belief networks. International Conference on Neural Information Processing. 600–603.1 indexed citations
18.
Nicholson, Ann E., et al.. (1997). Scheduling Trains with Genetic Algorithms. International Conference on Neural Information Processing. 1017–1020.2 indexed citations
19.
Dean, Thomas, Leslie Pack Kaelbling, Jak Kirman, & Ann E. Nicholson. (1993). Planning with deadlines in stochastic domains. National Conference on Artificial Intelligence. 574–579.122 indexed citations
20.
Nicholson, Ann E. & J. Michael Brady. (1992). The data association problem when monitoring robot vehicles using dynamic belief networks. European Conference on Artificial Intelligence. 689–693.17 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.