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 J. H. van Lint
Since
Specialization
Citations
This map shows the geographic impact of J. H. van Lint'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. H. van Lint with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. H. van Lint more than expected).
This network shows the impact of papers produced by J. H. van Lint. 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. H. van Lint. The network helps show where J. H. van Lint may publish in the future.
Co-authorship network of co-authors of J. H. van Lint
This figure shows the co-authorship network connecting the top 25 collaborators of J. H. van Lint.
A scholar is included among the top collaborators of J. H. van Lint 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. H. van Lint. J. H. van Lint 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.
Høholdt, Tom, et al.. (1998). An elementary approach to algebraic geometry codes. TU/e Research Portal (Eindhoven University of Technology). 135. 25–35.4 indexed citations
2.
Lint, J. H. van. (1998). Mathematics and the Compact Disc : Johan Bernouilli Lecture 1998. TU/e Research Portal. 16(3). 183–190.1 indexed citations
3.
Lint, J. H. van, R. Tijdeman, & Koninklijke Nederlandse Akademie van Wetenschappen. (1992). Cryptography and data protection : proceedings of a symposium at the Royal Netherlands Academy of Arts and Sciences on 19th December 1990. Data Archiving and Networked Services (DANS). 38.
4.
Lint, J. H. van. (1990). Concrete mathematics : a foundation for computer science / R.L. Graham, D.E. Knuth, O. Patashnik. Data Archiving and Networked Services (DANS). 4–5.44 indexed citations
5.
Lint, J. H. van. (1990). Sphere Packings, Lattices and Groups / J.H. Conway, N.J.A. Sloane. Data Archiving and Networked Services (DANS). 8(2). 235–238.4 indexed citations
Lint, J. H. van. (1968). Solution to Problem 5486 [1967,447] - Higher trigonometric identities. American Mathematical Monthly. 75(4). 421–422.1 indexed citations
15.
Lint, J. H. van. (1968). Solution to Problem 5460 [1967, 206] - Euler's constant. American Mathematical Monthly. 75(2). 202–202.1 indexed citations
Lint, J. H. van. (1966). Solution to Problem 5336 [1965,1030] - A sum over k-tuples. American Mathematical Monthly. 73(9). 1025–1026.
18.
Newman, Michael E. & J. H. van Lint. (1962). Solution to Problem 4944 [1961, 67] - Partitions of n. American Mathematical Monthly. 69(2). 175–175.1 indexed citations
19.
Lint, J. H. van, et al.. (1961). On a recurring process in arithmetic. 65–73.1 indexed citations
20.
Lint, J. H. van. (1961). Solution to Problem 60-8: Another sorting problem. SIAM Review. 3(4). 336–337.1 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.