Citations per year, relative to Arjen K. Lenstra Arjen K. Lenstra (= 1×)
peers
J. M. Pollard
Countries citing papers authored by Arjen K. Lenstra
Since
Specialization
Citations
This map shows the geographic impact of Arjen K. Lenstra'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 Arjen K. Lenstra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arjen K. Lenstra more than expected).
Fields of papers citing papers by Arjen K. Lenstra
This network shows the impact of papers produced by Arjen K. Lenstra. 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 Arjen K. Lenstra. The network helps show where Arjen K. Lenstra may publish in the future.
Co-authorship network of co-authors of Arjen K. Lenstra
This figure shows the co-authorship network connecting the top 25 collaborators of Arjen K. Lenstra.
A scholar is included among the top collaborators of Arjen K. Lenstra 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 Arjen K. Lenstra. Arjen K. Lenstra is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Lenstra, Arjen K., et al.. (2008). Security observance throughout the life-cycle of embedded systems. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 186–192.12 indexed citations
3.
Lenstra, Arjen K.. (2005). Further progress in hashing cryptanalysis. Infoscience (Ecole Polytechnique Fédérale de Lausanne).6 indexed citations
Dodson, Bruce, et al.. (2000). Factorization of a 512-bit RSA modulus. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 7. 1–21.24 indexed citations
6.
Lenstra, Arjen K. & Eric R. Verheul. (2000). Selecting Cryptographic Key Sizes.. TU/e Research Portal. 24.
Lenstra, Arjen K.. (1984). Polynomial-time algorithms for the factorization of polynomials. Data Archiving and Networked Services (DANS). 23(23). 59–76.4 indexed citations
Lenstra, Arjen K.. (1983). Factoring multivariate polynomials over algebraic number fields. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–15.2 indexed citations
17.
Lenstra, Arjen K.. (1983). Polynomial factorization by root approximation. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–7.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.