☰

Hendrik W. Lenstra - Publications

Affiliations: 
Mathematics University of California, Berkeley, Berkeley, CA, United States 
Area:
Algebraic number theory, Algorithms
Website:
https://math.berkeley.edu/people/faculty/hendrik-w-lenstra-jr
Tree Info Similar researchers PubMed Report error

40 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Bartel A, Lenstra HW. On class groups of random number fields Proceedings of the London Mathematical Society. 121: 927-953. DOI: 10.1112/Plms.12343  0.352
2020 Lenstra HW. The unit theorem for finite-dimensional algebras Expositiones Mathematicae. 38: 285-302. DOI: 10.1016/J.Exmath.2019.02.003  0.352
2018 Lenstra HW, Silverberg A. Algorithms for commutative algebras over the rational numbers Foundations of Computational Mathematics. 18: 159-180. DOI: 10.1007/S10208-016-9336-6  0.449
2018 Lenstra HW, Silverberg A. Universal gradings of orders Archiv Der Mathematik. 111: 579-597. DOI: 10.1007/S00013-018-1228-3  0.35
2017 Bartel A, Lenstra HW. Commensurability of automorphism groups Compositio Mathematica. 153: 323-346. DOI: 10.1112/S0010437X1600823X  0.302
2016 Lenstra HW, Silverberg A. Determining cyclicity of finite modules Journal of Symbolic Computation. 73: 153-156. DOI: 10.1016/J.Jsc.2015.06.002  0.341
2016 Lenstra HW, Silverberg A. Roots of Unity in Orders Foundations of Computational Mathematics. 1-27. DOI: 10.1007/S10208-016-9304-1  0.38
2016 Lenstra HW, Silverberg A. Lattices with Symmetry Journal of Cryptology. 1-45. DOI: 10.1007/S00145-016-9235-7  0.372
2014 Lenstra HW, Stevenhagen P, Moree P. Character sums for primitive root densities Mathematical Proceedings of the Cambridge Philosophical Society. 157: 489-511. DOI: 10.1017/S0305004114000450  0.371
2010 Lenstra H. Irreducible Cubics Modulo Five American Mathematical Monthly. 117: 817-821. DOI: 10.4169/000298910X521670  0.379
2007 Bernstein DJ, Lenstra HW, Pila J. Detecting perfect powers by factoring into coprimes Mathematics of Computation. 76: 385-388. DOI: 10.1090/S0025-5718-06-01837-0  0.316
2005 Cohen H, Lenstra HW, Zagier DB. Explicit Methods in Number Theory Oberwolfach Reports. 12: 1799-1866. DOI: 10.4171/Owr/2005/32  0.37
2002 Lenstra HW, Pila J, Pomerance C. A hyperelliptic smoothness test, II Proceedings of the London Mathematical Society. 84: 105-146. DOI: 10.1112/Plms/84.1.105  0.415
2002 Lenstra HW. On a problem of Garcia, Stichtenoth, and Thomas Finite Fields and Their Applications. 8: 166-170. DOI: 10.1006/Ffta.2001.0331  0.335
2001 Bach E, Von Zur Gathen J, Lenstra HW. Factoring polynomials over special finite fields Finite Fields and Their Applications. 7: 5-28. DOI: 10.1006/Ffta.2000.0306  0.4
2000 De Smit B, Lenstra HW. Linearly equivalent actions of solvable groups Journal of Algebra. 228: 270-285. DOI: 10.1006/Jabr.1999.8260  0.312
1997 De Smit B, Lenstra HW. Finite complete intersection algebras and the completeness radical Journal of Algebra. 196: 520-531. DOI: 10.1006/Jabr.1997.7104  0.31
1995 Bosma W, Lenstra HW. Complete Systems of Two Addition Laws for Elliptic Curves Journal of Number Theory. 53: 229-240. DOI: 10.1006/Jnth.1995.1088  0.318
1993 Lenstra HW, Pila J, Pomerance C. A hyperelliptic smoothness test. I Philosophical Transactions of the Royal Society A. 345: 397-408. DOI: 10.1098/Rsta.1993.0138  0.346
1993 Lenstra HW, Shallit JO. Continued fractions and linear recurrences Mathematics of Computation. 61: 351-354. DOI: 10.1090/S0025-5718-1993-1192972-X  0.324
1993 Lenstra AK, Lenstra HW, Manasse MS, Pollard JM. The factorization of the ninth fermat number Mathematics of Computation. 61: 319-349. DOI: 10.1090/S0025-5718-1993-1182953-4  0.376
1992 Lenstra HW, Pomerance C. A rigorous time bound for factoring integers Journal of the American Mathematical Society. 5: 483-516. DOI: 10.1090/S0894-0347-1992-1137100-0  0.41
1992 Lenstra HW. Algorithms in algebraic number theory Bulletin of the American Mathematical Society. 26: 211-244. DOI: 10.1090/S0273-0979-1992-00284-7  0.433
1992 Gao S, Lenstra HW. Optimal normal bases Designs, Codes and Cryptography. 2: 315-323. DOI: 10.1007/Bf00125200  0.332
1991 Lenstra HW. Finding isomorphisms between finite fields Mathematics of Computation. 56: 329-347. DOI: 10.1090/S0025-5718-1991-1052099-2  0.379
1990 Lenstra HW. Automorphisms of finite fields Journal of Number Theory. 34: 33-40. DOI: 10.1016/0022-314X(90)90050-2  0.31
1987 Lenstra HW. Factoring integers with elliptic curves Annals of Mathematics. 126: 649-673. DOI: 10.2307/1971363  0.349
1987 Lenstra HW, Schoof RJ. Primitive normal bases for finite fields Mathematics of Computation. 48: 217-231. DOI: 10.1090/S0025-5718-1987-0866111-3  0.339
1984 Schnorr CP, Lenstra HW. A monte carlo factoring algorithm with linear storage Mathematics of Computation. 43: 289-311. DOI: 10.1090/S0025-5718-1984-0744939-5  0.343
1984 Lenstra HW. Divisors in residue classes Mathematics of Computation. 42: 331-340. DOI: 10.1090/S0025-5718-1984-0726007-1  0.38
1984 Cohen H, Lenstra HW. Primalitv testing and jacobi sums Mathematics of Computation. 42: 297-330. DOI: 10.1090/S0025-5718-1984-0726006-X  0.322
1982 Lenstra AK, Lenstra HW, Lovász L. Factoring polynomials with rational coefficients Mathematische Annalen. 261: 515-534. DOI: 10.1007/Bf01457454  0.332
1981 Lenstra HW. Grothendieck groups of abelian group rings Journal of Pure and Applied Algebra. 20: 173-193. DOI: 10.1016/0022-4049(81)90091-8  0.314
1980 Lenstra HW, van der Poorten AJ. Euclidean number fields 3 The Mathematical Intelligencer. 2: 99-103. DOI: 10.1007/Bf03023382  0.333
1980 Lenstra HW, van der Poorten A. Euclidean number fields 2 The Mathematical Intelligencer. 2: 73-77. DOI: 10.1007/Bf03023376  0.333
1979 Lenstra HW, van der Poorten AJ. Euclidean number fields 1 The Mathematical Intelligencer. 2: 6-15. DOI: 10.1007/Bf03024378  0.333
1977 Lenstra HW. On Artin's conjecture and Euclid's algorithm in global fields Inventiones Mathematicae. 42: 201-224. DOI: 10.1007/Bf01389788  0.311
1976 Lenstra HW. Euclidean number fields of large degree Inventiones Mathematicae. 38: 237-254. DOI: 10.1007/Bf01403131  0.353
1975 Lenstra HW. Euclid’s Algorithm in Cyclotomic Fields Journal of the London Mathematical Society. 457-465. DOI: 10.1112/Jlms/S2-10.4.457  0.338
1974 Lenstra HW. Rational functions invariant under a finite abelian group Inventiones Mathematicae. 25: 299-325. DOI: 10.1007/Bf01389732  0.322
Show low-probability matches.