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.
Countries citing papers authored by C. E. M. Pearce
Since
Specialization
Citations
This map shows the geographic impact of C. E. M. Pearce'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 C. E. M. Pearce with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C. E. M. Pearce more than expected).
This network shows the impact of papers produced by C. E. M. Pearce. 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 C. E. M. Pearce. The network helps show where C. E. M. Pearce may publish in the future.
Co-authorship network of co-authors of C. E. M. Pearce
This figure shows the co-authorship network connecting the top 25 collaborators of C. E. M. Pearce.
A scholar is included among the top collaborators of C. E. M. Pearce 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 C. E. M. Pearce. C. E. M. Pearce is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
McDonnell, Mark D., Derek Abbott, Nigel G. Stocks, & C. E. M. Pearce. (2008). Stochastic Resonance. arXiv (Cornell University).1223 indexed citations breakdown →
Dragomir, Sever S, C. E. M. Pearce, & Josip Pečarić. (2001). Some New Inequalities for the Logarithmic Map, with Applications to Entropy and Mutual Information. Kyungpook mathematical journal. 41(1). 115–115.
7.
Pearce, C. E. M., et al.. (2001). HADAMARD AND DRAGOMIR-AGARWAL INEQUALITIES, HIGHER-ORDER CONVEXITY AND THE EULER FORMULA. Journal of the Korean Mathematical Society. 38(6). 1235–1243.2 indexed citations
8.
Cerone, Pietro, Sever S Dragomir, & C. E. M. Pearce. (2000). A Generalized Trapezoid Inequality for Functions of Bounded Variation. TURKISH JOURNAL OF MATHEMATICS. 24(2). 147–163.42 indexed citations
Pearce, C. E. M., et al.. (1998). Multiple Choice Problems Related to the Duration of the Secretary Problem. Kyoto University Research Information Repository (Kyoto University). 1068(79). 75–86.1 indexed citations
11.
Pearce, C. E. M., Josip Pečarić, & Bernhard Neumann. (1998). On weighted generalized logarithmic means. Houston journal of mathematics. 24(3). 459–466.7 indexed citations
12.
Rhee, Kyung-Hyune & C. E. M. Pearce. (1997). ON SOME BASIC PROPERTIES OF THE INHOMOGENEOUS QUASI-BIRTH-AND-DEATH PROCESS. Communications of the Korean Mathematical Society. 12(1). 177–192.1 indexed citations
13.
Mond, B., C. E. M. Pearce, & Josip Pečarić. (1997). The logarithmic mean is a mean. Mathematical communications. 2(1). 35–39.10 indexed citations
14.
Pearce, C. E. M.. (1997). Faculty of Textile Technology. 168(8). 969–73.1 indexed citations
15.
Gill, Peter M. W., C. E. M. Pearce, & Josip Pečarić. (1997). Hadamard's Inequality forr-Convex Functions. Journal of Mathematical Analysis and Applications. 215(2). 461–470.55 indexed citations
16.
Pearce, C. E. M., et al.. (1996). Some generalizations of the Beckenbach-Dresher inequality. Houston journal of mathematics. 22(3). 629–638.4 indexed citations
Pearce, C. E. M. & Josip Pečarić. (1994). An Inequality for Convex Functions. Journal of Mathematical Analysis and Applications. 183(3). 523–527.8 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.