H. W. Lenstra
Impact in
- Algebra and Number Theory top 1%
- Analytic Number Theory Research
Papers in
-
- History and Theory of Mathematics 10
-
- Analytic Number Theory Research 17
- Rings, Modules, and Algebras 16
- Commutative Algebra and Its Applications 8
- Co-authors
- László LovászArjen K. LenstraJeffrey C. LagariasC. P. SchnorrPeter StevenhagenMark S. ManasseJ. M. PollardRené Schoof
- Journals
- Mathematics of Computation (12 papers)Journal of Algebra (5 papers)Inventiones mathematicae (3 papers)Journal of Number Theory (3 papers)Finite Fields and Their Applications (2 papers)
- Partner nations
- United StatesNetherlandsAustralia
In The Last Decade
H. W. Lenstra
89 papers receiving 4.3k citations
Hit Papers
Peers
Comparison fields: 5 of 91
- Algebra and Number Theory 749
- Discrete Mathematics and Combinatorics 445
- Geometry and Topology 1.1k
- Computational Theory and Mathematics 1.6k
- Artificial Intelligence 2.6k
Countries citing papers authored by H. W. Lenstra
This map shows the geographic impact of H. W. 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 H. W. Lenstra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites H. W. Lenstra more than expected).
Fields of papers citing papers by H. W. Lenstra
This network shows the impact of papers produced by H. W. 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 H. W. Lenstra. The network helps show where H. W. Lenstra may publish in the future.
Co-authors
The 25 scholars most cited alongside H. W. 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 | Testing isomorphism of lattices over CM-orders | 2017 | 1 |
| 2 | 2015 | 2 | |
| 3 | 2008 | 20 | |
| 4 | 2001 | 8 | |
| 5 | 2000 | 6 | |
| 6 | 1997 | 3 | |
| 7 | 1995 | 20 | |
| 8 | 1993 | 6 | |
| 9 | 1992 | 81 | |
| 10 | 1992 | 13 | |
| 11 | 1992 | 41 | |
| 12 | 1991 | 12 | |
| 13 | Quotients of group rings arising from two-dimensional representations | 1991 | 32 |
| 14 | 1990 | 2 | |
| 15 | 1989 | 31 | |
| 16 | Computational methods in number theory | 1982 | 42 |
| 17 | Primality testing algorithms | 1980 | 1 |
| 18 | Euclidean ideal classes | 1978 | 14 |
| 19 | The acyclic subgraph problem | 1973 | 11 |
| 20 | 1972 | 22 |
About H. W. Lenstra
H. W. Lenstra is a scholar working on Theoretical Computer Science, Algebra and Number Theory, Geometry and Topology, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 94 papers that have together received 5.0k indexed citations. Recurring topics across this work include Coding theory and cryptography (30 papers), Algebraic Geometry and Number Theory (26 papers), Analytic Number Theory Research (17 papers), Polynomial and algebraic computation (16 papers), Rings, Modules, and Algebras (16 papers), Cryptography and Residue Arithmetic (15 papers), History and Theory of Mathematics (10 papers) and Commutative Algebra and Its Applications (8 papers). The work is most often cited by research in Algebra and Number Theory (749 citations), Discrete Mathematics and Combinatorics (445 citations), Geometry and Topology (1.1k citations), Computational Theory and Mathematics (1.6k citations) and Artificial Intelligence (2.6k citations). H. W. Lenstra has collaborated with scholars based in United States, Netherlands and Australia. Frequent co-authors include László Lovász, Arjen K. Lenstra, Jeffrey C. Lagarias, C. P. Schnorr, Peter Stevenhagen, Mark S. Manasse, J. M. Pollard, René Schoof, Carl Pomerance and Leonard M. Adleman. Their work appears in journals such as Mathematics of Computation, Journal of Algebra, Inventiones mathematicae, Journal of Number Theory and Finite Fields and Their Applications.
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.