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.
Citations per year, relative to Louis Comtet Louis Comtet (= 1×)
peers
P. Túrán
Countries citing papers authored by Louis Comtet
Since
Specialization
Citations
This map shows the geographic impact of Louis Comtet'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 Louis Comtet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Louis Comtet more than expected).
This network shows the impact of papers produced by Louis Comtet. 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 Louis Comtet. The network helps show where Louis Comtet may publish in the future.
Co-authorship network of co-authors of Louis Comtet
This figure shows the co-authorship network connecting the top 25 collaborators of Louis Comtet.
A scholar is included among the top collaborators of Louis Comtet 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 Louis Comtet. Louis Comtet is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
7 of 7 papers shown
1.
Riordan, John R. & Louis Comtet. (1976). Advanced Combinatorics. Mathematics of Computation. 30(133). 190–190.234 indexed citations
Comtet, Louis & J.W. Nienhuys. (1974). Advanced Combinatorics: The Art of Finite and Infinite Expansions. Bulletin of Miscellaneous Information (Royal Gardens Kew).624 indexed citations breakdown →
4.
Hewitt, Edwin, et al.. (1967). Advanced Problems: 5470-5479. American Mathematical Monthly. 74(3). 328–328.1 indexed citations
Greenberg, Ralph, et al.. (1966). 5286. American Mathematical Monthly. 73(4). 426–426.1 indexed citations
7.
Simon, Hermann, et al.. (1965). Advanced Problems: 5300-5309. American Mathematical Monthly. 72(6). 673–673.5 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.