Hendrik Lenstra | Academic Influence

Hendrik Lenstra's AcademicInfluence.com Rankings

Hendrik Lenstra

Mathematics

#471

World Rank

#925

Historical Rank

Number Theory

#38

World Rank

#61

Historical Rank

Measure Theory

#944

World Rank

#1230

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Hendrik Lenstra's Degrees

PhD Mathematics University of Amsterdam
Masters Mathematics University of Amsterdam

Why Is Hendrik Lenstra Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Hendrik Willem Lenstra Jr. is a Dutch mathematician. Biography Lenstra received his doctorate from the University of Amsterdam in 1977 and became a professor there in 1978. In 1987, he was appointed to the faculty of the University of California, Berkeley; starting in 1998, he divided his time between Berkeley and the University of Leiden, until 2003, when he retired from Berkeley to take a full-time position at Leiden.

(See a Problem?)

Hendrik Lenstra's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Factoring polynomials with rational coefficients (1982) (4126)
Integer Programming with a Fixed Number of Variables (1983) (1442)
Factoring integers with elliptic curves (1987) (1113)
Profinite Groups (2003) (984)
The Development of the Number Field Sieve (1993) (304)
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (1990) (298)
Factoring integers with the number field sieve (1993) (234)
Chebotarëv and his density theorem (1996) (226)
Algorithms in Number Theory (1991) (189)
The number field sieve (1990) (173)
Rational functions invariant under a finite abelian group (1974) (169)
Algorithms in algebraic number theory (1992) (167)
Primitive normal bases for finite fields (1987) (151)
A rigorous time bound for factoring integers (1992) (135)
On Artin's conjecture and Euclid's algorithm in global fields (1977) (130)
Primality testing and Jacobi sums (1984) (123)
Optimal normal bases (1992) (117)
Finding irreducible polynomials over finite fields (1986) (115)
On the calculation of regulators and class numbers of quadratic fields (1982) (113)
The factorization of the ninth Fermat number (1993) (111)
Primality Testing with Gaussian Periods (2002) (110)
Finding isomorphisms between finite fields (1991) (105)
Finding small degree factors of lacunary polynomials (1999) (80)
A Monte Carlo factoring algorithm with linear storage (1984) (78)
Quotients of group rings arising from two-dimensional representations (1991) (78)
Explicit construction of universal deformation rings (1997) (77)
Heuristics on class groups (1984) (77)
Modeling the distribution of ranks, Selmer groups, and Shafarevich-Tate groups of elliptic curves (2013) (71)
Approximatting rings of integers in number fields. (1994) (66)
Euclidean number fields of large degree (1976) (64)
Subgroups close to normal subgroups (1989) (61)
Galois theory for schemes (1985) (59)
On the factorization of lacunary polynomials (1999) (55)
Complete Systems of Two Addition Laws for Elliptic Curves (1995) (49)
Divisors in residue classes (1983) (49)
A sharpened version of the aanderaa-rosenberg conjecture (1974) (44)
Miller's Primality Test (1979) (42)
On hats and other covers (2002) (41)
Elliptic curves and number-theoretic algorithms (1986) (40)
GROTHENDIECK GROUPS OF ABELIAN GROUP RINGS (1981) (38)
Simple abelian varieties having a prescribed formal isogeny type. (1974) (38)
Character sums for primitive root densities (2011) (37)
Abelian varieties having purely additive reduction (1985) (34)
Continued fractions and linear recurrences (1993) (34)
Vanishing sums of roots of unity (1979) (33)
Primality testing algorithms [after Adleman, Rumely and Williams] (1981) (33)
On the Chor—Rivest knapsack cryptosystem (2004) (29)
Two theorems on perfect codes (1972) (29)
Factoring polynomials with rational coefficients : (preprint) (1982) (28)
Revisiting the Gentry-Szydlo Algorithm (2014) (28)
Complete intersections and Gorenstein rings (1995) (26)
The Mathematical Structure of Escher’s Print Gallery (2007) (26)
Flags and Lattice Basis Reduction (2001) (25)
A Hyperelliptic Smoothness Test, II (2002) (25)
Linearly equivalent actions of solvable groups. (2000) (24)
A family of exceptional polynomials in characteristic three (1996) (22)
Detecting perfect powers by factoring into coprimes (2007) (22)
Quadratic forms and quaternion algebras: algorithms and arithmetic (2005) (22)
Codes from algebraic number fields (1986) (21)
The Tate conjecture for almost ordinary Abelian varieties over finite fields (1993) (21)
Factoring Polynomials over Special Finite Fields (2001) (20)
A normal basis theorem for infinite Galois extensions (1985) (19)
Applied number theory (1990) (18)
Lattices with Symmetry (2013) (18)
K2 of a global field consists of symbols (1976) (18)
On a Problem of Garcia, Stichtenoth, and Thomas (2002) (18)
Primality testing algorithms (1981) (17)
On class groups of random number fields (2018) (17)
Galois theory and primality testing (1985) (16)
The acyclic subgraph problem (1973) (15)
Approximating rings of integers in number fields par (2006) (14)
The History of the LLL-Algorithm (2010) (13)
Commensurability of automorphism groups (2015) (13)
Euclidean ideal classes (1978) (13)
Rational functions invariant under a cyclic group (1980) (13)
Euclidean number fields 1 (1979) (12)
Addendum: “The factorization of the ninth Fermat number” [Math. Comp. 61 (1993), no. 203, 319–349; MR1182953 (93k:11116)] (1995) (12)
Algorithms for Commutative Algebras Over the Rational Numbers (2015) (12)
Integer programming and cryptography (1984) (11)
Artin reciprocity and Mersenne primes (2000) (11)
HEURISTICS FOR THE ARITHMETIC OF ELLIPTIC CURVES (2017) (10)
Euclidean number fields 2 (1980) (9)
Primes of degree one and algebraic cases of fi Cebotarev's theorem. (1991) (9)
Finite Complete Intersection Algebras and the Completeness Radical (1997) (9)
Approximating rings of integers in number eldsJ (1994) (9)
Standard models for finite fields (2013) (7)
Computing Jacobi symbols in algebraic number fields (1995) (7)
Abelian extensions of arbitrary fields (1975) (7)
Euclidean number fields 3 (1980) (7)
Roots of Unity in Orders (2015) (7)
On the algebraic closure of two (1977) (6)
On the inverse Fermat equation (1992) (6)
Groups with finitely many non-normal subgroups (1990) (6)
Linear independence of cosecant values (1975) (6)
Fast prime number tests (1983) (6)
Automorphisms of finite fields (1990) (6)
The number field sieve: An annotated bibliography (1993) (5)
I T ] 1 5 Se p 20 05 On Hats and other Covers ( Extended Summary ) (2008) (5)
Testing isomorphism of lattices over CM-orders (2017) (5)
Construction of the ring of Witt vectors (2018) (4)
Class Field Theory and the First Case of Fermat’s Last Theorem (1997) (4)
The number field sieve (NFS), Sec. 5.1.3 (1992) (4)
Artful Mathematics: The Heritage of M. C. Escher, Celebrating Mathematics Awareness Month, Volume 50, Number 4 (2003) (4)
Universal gradings of orders (2017) (4)
ENTANGLED RADICALS (2010) (3)
Arakelov class groups of random number fields (2020) (3)
Primality Testing with Artin Symbols (1982) (3)
Chebotar v and his Density Theorem 1 (1996) (3)
Advanced Problems: 6060-6065 (1975) (2)
Primality and factorization (1983) (2)
Perfect arithmetic codes (1978) (1)
Euclid's algorithm in large Dedekind domains (1986) (1)
Primality testing algorithms, Séminaire Bourbaki 33 exp. no. 576 (1981) (1)
On a question of Colliot-Thélène (1982) (1)
Generating units modulo an odd integer by addition and subtraction (1993) (1)
Irreducible Cubics Modulo Five (2010) (1)
Sharp characters with one rational value (1994) (1)
Galois module structure of oriented Arakelov class groups (2020) (1)
Determining cyclicity of finite modules (2014) (1)
PROVING PRIMALITY AFTER AGRAWAL-KAYAL-SAXENA (2022) (1)
Rat ional Funct ions Invariant under a Finite Abel ian Group (2005) (0)
PEM volume 37 issue 3 Cover and Back matter (1994) (0)
Addendum: The Factorization of the Ninth Fermat Number (1995) (0)
Eficient algorithms in number theory (1986) (0)
Realizing orders as group rings (2022) (0)
Book Review: Mathematics of Computation 1943--1993: A half-century of computational mathematics@@@Book Review: Afternotes on numerical analysis@@@Book Review: Navier-Stokes equations and nonlinear functional analysis@@@Book Review: Numerical solution of the incompressible Navier-Stokes equations@@@B (1997) (0)
The unit theorem for finite-dimensional algebras (2017) (0)
An Attack Bound for Small Multiplicative Inverse of φ ( N ) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques (2018) (0)
C Probability Theory (0)
Math 254B: Number theory (0)
Universal gradings of orders (2018) (0)
Galois Groups of Radical Extensions (2003) (0)
Lattices with Symmetry (2016) (0)
Algorithms for Commutative Algebras Over the Rational Numbers (2016) (0)
Roots of Unity in Orders (2016) (0)
' Cojaments , suggestions , and related referenoes » eloomedJ Subgroups close to normal subgroups (2005) (0)
FAST PRIME NUMBER TESTS Text of a lecture held at the Wintersymposium " Elementen van de Wiskunde " of the Wiskundig Genootschap (2005) (0)
Using Mathematics to Make Computing on Encrypted Data Secure and Practical (2015) (0)
pp. 313–326 in: Modular Forms and Fermat’s Last Theorem, Cornell, Silverman, Stevens (eds.), Springer-Verlag 1997. Explicit Construction of Universal Deformation Rings (1995) (0)
DUAL ELLIPTIC PRIMES AND APPLICATIONS TO CYCLOTOMY PRIMALITY PROVING (2007) (0)
Abelian varieties having very bad reduction (1983) (0)
Segment and Strong Segment LLL-Reduction of Lattice Bases (2002) (0)
A transfinite generalisation of a combinatorial problem on abelian groups. (1969) (0)
The Problem Selection Committee Consisted Of (2011) (0)
Restricting the Order of Elements in a Group: 10684 (2000) (0)
ON MULTIDIMENSIONAL DIOPHANTINE APPROXIMATION OF ALGEBRAIC NUMBERS (2015) (0)
Elementary Problems: E3361-E3366 (1990) (0)
1 Integer Linear Programming : An Introduction (2019) (0)
Two Theokems on Perfect Codes $0. Introduction (0)
Advanced Problems: 6339-6343 (1981) (0)
—l — PRIMALITY TESTING WITH FROBENIUS SYMBOLS (2005) (0)
A Definition of the System of Natural Numbers, Equivalent to that of Peano (1968) (0)
Factoring integere with elliptic curves-H W Lenstra , Ji-verewn 19860508 Factoring integere with elliptic curves (2005) (0)
Book Review: Solving the Pell equation (2014) (0)
Necessary conditions for the existence of perfect Lee codes (1975) (0)
The mathematical tourist (1987) (0)
Artin's conjecture on primes with prescribed primitive roots (1978) (0)
Algebraic aspects of the Number Field Sieve (2016) (0)
Primality Testing (2005) (0)
Bases for Boolean rings. (1973) (0)
IMO2011 Shortlisted Problems (2011) (0)
Version 19960925 l Class field theory and the first case of Fermat ' s last theorem (0)
Does the Set of Points of an Elliptic Curve Determine the Group (1995) (0)
Harald Niederreiter (austrian Academy of Sciences): Remarkable Sequences Ob- Tained from Global Function Fields (0)
Plenary Lectures (2008) (0)
Powers of commutators (2022) (0)
Chapter 1 The History of the LLL-Algorithm (2010) (0)
Reduced bases for lattices and factorization of polynomials, Sém. théorie des nombres (1982) (0)
Primality testing with Frobenius symbols (1981) (0)
N T ] 1 2 A pr 2 01 8 ON CLASS GROUPS OF RANDOM NUMBER FIELDS (2018) (0)
Multiplicative division algorithms on the integers (1973) (0)

This paper list is powered by the following services:

Other Resources About Hendrik Lenstra

en.wikipedia.org

What Schools Are Affiliated With Hendrik Lenstra?

Hendrik Lenstra is affiliated with the following schools:

Image Attributions

Image Source for Hendrik Lenstra