A. K. Lenstra
Impact in
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Polynomial and algebraic computation
- Algebra and Number Theory top 10%
Papers in
-
- Coding theory and cryptography 3
- Cryptography and Data Security 1
-
- Chaos-based Image/Signal Encryption 2
- Co-authors
- László Lovász (2 shared papers)H. W. Lenstra (1 shared paper)Ravi Kannan (1 shared paper)
- Partner nations
- Netherlands
In The Last Decade
A. K. Lenstra
3 papers receiving 1.8k citations
A. K. Lenstra's Hit Papers
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 622
- Algebra and Number Theory 164
- Artificial Intelligence 1.1k
- Geometry and Topology 222
- Discrete Mathematics and Combinatorics 78
Countries citing papers authored by A. K. Lenstra
This map shows the geographic impact of A. 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 A. 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 A. K. Lenstra more than expected).
Fields of papers citing papers by A. K. Lenstra
This network shows the impact of papers produced by A. 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 A. K. Lenstra. The network helps show where A. K. Lenstra may publish in the future.
Co-authors
The 3 scholars most cited alongside A. K. Lenstra, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Factoring polynomials with rational coefficients Hit paper breakdown → | 1982 | 1966 |
| 2 | 1988 | 39 | |
| 3 | 1988 | 6 |
About A. K. Lenstra
A. K. Lenstra is a scholar working on Artificial Intelligence, Computer Vision and Pattern Recognition, Algebra and Number Theory, Electrical and Electronic Engineering and Infectious Diseases, having authored 3 papers that have together received 2.0k indexed citations. Recurring topics across this work include Coding theory and cryptography (3 papers), Chaos-based Image/Signal Encryption (2 papers), graph theory and CDMA systems (1 paper), Cryptography and Data Security (1 paper) and Analytic Number Theory Research (1 paper). The work is most often cited by research in Computational Theory and Mathematics (622 citations), Algebra and Number Theory (164 citations), Artificial Intelligence (1.1k citations), Geometry and Topology (222 citations) and Discrete Mathematics and Combinatorics (78 citations). A. K. Lenstra has collaborated with scholars based in Netherlands. Frequent co-authors include László Lovász, H. W. Lenstra and Ravi Kannan. Their work appears in journals such as Mathematics of Computation and Mathematische Annalen.
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.