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 Donald E. Knuth
Since
Specialization
Citations
This map shows the geographic impact of Donald E. Knuth'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 Donald E. Knuth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Donald E. Knuth more than expected).
This network shows the impact of papers produced by Donald E. Knuth. 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 Donald E. Knuth. The network helps show where Donald E. Knuth may publish in the future.
Co-authorship network of co-authors of Donald E. Knuth
This figure shows the co-authorship network connecting the top 25 collaborators of Donald E. Knuth.
A scholar is included among the top collaborators of Donald E. Knuth 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 Donald E. Knuth. Donald E. Knuth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Knuth, Donald E.. (2011). Art of Computer Programming, Volumes 1-4A Boxed Set.10 indexed citations
2.
Greene, Daniel & Donald E. Knuth. (2007). Mathematics for the Analysis of Algorithms: Modern Birkhuser Classics. Birkhäuser Basel eBooks.2 indexed citations
3.
Knuth, Donald E.. (2005). The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming).61 indexed citations
4.
Knuth, Donald E.. (2005). MMIX : a RISC computer for the new millennium. Addison-Wesley eBooks.5 indexed citations
5.
Knuth, Donald E.. (2000). Dancing links. arXiv (Cornell University).100 indexed citations
Knuth, Donald E.. (1994). Leaper graphs. The Mathematical Gazette. 78(483). 274–297.5 indexed citations
8.
Knuth, Donald E., Rajeev Motwani, & Boris Pittel. (1990). Stable husbands. Symposium on Discrete Algorithms. 397–404.12 indexed citations
9.
Knuth, Donald E. & Boris Pittel. (1989). A Recurrence Related to Trees. Proceedings of the American Mathematical Society. 105(2). 335–335.5 indexed citations
10.
Knuth, Donald E. & Boris Pittel. (1989). A recurrence related to trees. Proceedings of the American Mathematical Society. 105(2). 335–349.38 indexed citations
11.
Knuth, Donald E.. (1987). The T E Xbook. Addison-Wesley Longman Publishing Co., Inc. eBooks.19 indexed citations
12.
Knuth, Donald E., et al.. (1986). The Computers & Typesetting, Vol. A: The Texbook. Addison-Wesley Longman Publishing Co., Inc. eBooks.3 indexed citations
13.
Knuth, Donald E.. (1977). The Computer as Master Mind. 9. 1–6.56 indexed citations
14.
Knuth, Donald E.. (1974). Surreal numbers : how two ex-students turned on to pure mathematics and found total happiness : a mathematical novelette. Addison-Wesley Pub. Co. eBooks.15 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.