We stand with Ukraine  

Hendrik W. Lenstra Jr.

Affiliations:
  • Leiden University, Netherlands


According to our database1, Hendrik W. Lenstra Jr. authored at least 24 papers between 1972 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Testing Isomorphism of Lattices over CM-Orders.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Alice Silverberg
SIAM J. Comput., 2019

2018
Algorithms for Commutative Algebras Over the Rational Numbers.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Alice Silverberg
Found. Comput. Math., 2018

2017
Lattices with Symmetry.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Alice Silverberg
J. Cryptol., 2017

Roots of Unity in Orders.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Alice Silverberg
Found. Comput. Math., 2017

2016
Determining cyclicity of finite modules.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Alice Silverberg
J. Symb. Comput., 2016

2014
Revisiting the Gentry-Szydlo Algorithm.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Alice Silverberg
IACR Cryptol. ePrint Arch., 2014

2013
Lattices with symmetry.
[BibTeX]
[DOI]
Hendrik Lenstra
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Standard models for finite fields.
[BibTeX]
Bart de Smit
,
Hendrik Lenstra
Proceedings of the Handbook of Finite Fields., 2013

2010
The History of the LLL-Algorithm.
[BibTeX]
[DOI]
Ionica Smeets
,
Arjen K. Lenstra
,
Hendrik Lenstra
,
László Lovász
,
Peter van Emde Boas
Proceedings of the LLL Algorithm - Survey and Applications, 2010

Irreducible Cubics Modulo Five.
[BibTeX]
[DOI]
Hendrik Lenstra
Am. Math. Mon., 2010

2007
Detecting perfect powers by factoring into coprimes.
[BibTeX]
[DOI]
Daniel J. Bernstein
,
Hendrik W. Lenstra Jr.
,
Jonathan Pila
Math. Comput., 2007

2005
On Hats and other Covers
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
,
Gadiel Seroussi
CoRR, 2005

2002
Primality Testing with Gaussian Periods.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2000
Restricting the Order of Elements in a Group: 10684.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
Am. Math. Mon., 2000

1992
On the inverse Fermat equation.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
Discret. Math., 1992

Optimal Normal Bases.
[BibTeX]
[DOI]
Shuhong Gao
,
Hendrik W. Lenstra Jr.
Des. Codes Cryptogr., 1992

1991
On the Chor-Rivest Knapsack Cryptosystem.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
J. Cryptol., 1991

1990
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice.
[BibTeX]
[DOI]
J. C. Lagarias
,
Hendrik W. Lenstra Jr.
,
Claus-Peter Schnorr
Comb., 1990

The Number Field Sieve
[BibTeX]
[DOI]
Arjen K. Lenstra
,
Hendrik W. Lenstra Jr.
,
Mark S. Manasse
,
John M. Pollard
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Algorithms in Number Theory.
[BibTeX]
Arjen K. Lenstra
,
Hendrik W. Lenstra Jr.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1986
Finding Irreducible Polynomials over Finite Fields
[BibTeX]
[DOI]
Leonard M. Adleman
,
Hendrik W. Lenstra Jr.
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1983
Integer Programming with a Fixed Number of Variables.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
Math. Oper. Res., 1983

1979
Miller's Primality Test.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
Inf. Process. Lett., 1979

1972
Two theorems on perfect codes.
[BibTeX]
[DOI]
Hendrik W. Lenstra Jr.
Discret. Math., 1972


  Loading...