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.
Temporal data classification and forecasting using a memristor-based reservoir computing system
This map shows the geographic impact of J. W. Moon'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 J. W. Moon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. W. Moon more than expected).
This network shows the impact of papers produced by J. W. Moon. 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 J. W. Moon. The network helps show where J. W. Moon may publish in the future.
Co-authorship network of co-authors of J. W. Moon
This figure shows the co-authorship network connecting the top 25 collaborators of J. W. Moon.
A scholar is included among the top collaborators of J. W. Moon 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 J. W. Moon. J. W. Moon is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Moon, J. W.. (2002). On the centroid of recursive trees.. Australas. J Comb.. 25. 211–220.1 indexed citations
5.
Moon, J. W. & Helmut Prodinger. (2000). A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.. Ars Combinatoria. 55.1 indexed citations
6.
Meir, A. & J. W. Moon. (1999). On the Bipartition Numbers of Random Trees, II.. Ars Combinatoria. 51.1 indexed citations
7.
Clark, Lane, A. Meir, & J. W. Moon. (1999). On the Steiner distance of trees from certain families.. Australas. J Comb.. 20. 47–68.2 indexed citations
8.
Clark, Lane & J. W. Moon. (1999). On the General Randic Index for Certain Families of Trees.. Ars Combinatoria. 54.28 indexed citations
9.
Entringer, R. C., A. Meir, J. W. Moon, & Łászló A. Székely. (1994). ON THE WIENER INDEX OF TREES FROM CERTAIN FAMILIES. Australas. J Comb.. 10. 211–224.26 indexed citations
10.
Moon, J. W.. (1993). Uncovered nodes and 3-cycles in tournaments.. Australas. J Comb.. 7. 157–174.1 indexed citations
11.
Meir, A. & J. W. Moon. (1990). On the maximum out-degree in random trees.. Australas. J Comb.. 2. 147–156.6 indexed citations
Fallahi, Esmaeil, et al.. (1989). 12種台木の「Redblush」グレープフルーツの収量と品質. Journal of the American Society for Horticultural Science. 114(2). 187–190.10 indexed citations
15.
Moon, J. W.. (1969). On Cycles in Tournaments. Czech digital mathematics library. 19(2). 121–125.3 indexed citations
16.
Pullman, Norman J. & J. W. Moon. (1968). Tournaments and handicaps.. IFIP Congress. 219–223.4 indexed citations
17.
Moon, J. W. & L.E. Moser. (1966). A matrix reduction problem. Mathematics of Computation. 20(94). 328–330.4 indexed citations
18.
Moon, J. W.. (1965). On a Problem of Ore. The Mathematical Gazette. 49(367). 40–41.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.