![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hendrik W. Lenstra Jr.
Person information
- affiliation: Leiden University, Netherlands
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j15]Hendrik W. Lenstra Jr., Alice Silverberg:
Testing Isomorphism of Lattices over CM-Orders. SIAM J. Comput. 48(4): 1300-1334 (2019) - 2018
- [j14]Hendrik W. Lenstra Jr., Alice Silverberg:
Algorithms for Commutative Algebras Over the Rational Numbers. Found. Comput. Math. 18(1): 159-180 (2018) - 2017
- [j13]Hendrik W. Lenstra Jr., Alice Silverberg:
Roots of Unity in Orders. Found. Comput. Math. 17(3): 851-877 (2017) - [j12]Hendrik W. Lenstra Jr., Alice Silverberg:
Lattices with Symmetry. J. Cryptol. 30(3): 760-804 (2017) - [i6]Hendrik W. Lenstra Jr., Alice Silverberg:
Testing isomorphism of lattices over CM-orders. CoRR abs/1706.07373 (2017) - 2016
- [j11]Hendrik W. Lenstra Jr., Alice Silverberg:
Determining cyclicity of finite modules. J. Symb. Comput. 73: 153-156 (2016) - 2015
- [i5]Hendrik W. Lenstra Jr., Alice Silverberg:
Lattices with Symmetry. CoRR abs/1501.00178 (2015) - [i4]Hendrik W. Lenstra Jr., Alice Silverberg:
Roots of unity in orders. CoRR abs/1509.02612 (2015) - 2014
- [c5]Hendrik W. Lenstra Jr., Alice Silverberg:
Revisiting the Gentry-Szydlo Algorithm. CRYPTO (1) 2014: 280-296 - [i3]Hendrik W. Lenstra Jr., Alice Silverberg:
Revisiting the Gentry-Szydlo Algorithm. IACR Cryptol. ePrint Arch. 2014: 430 (2014) - [i2]Hendrik W. Lenstra Jr., Alice Silverberg:
Lattices with Symmetry. IACR Cryptol. ePrint Arch. 2014: 1026 (2014) - 2013
- [c4]Hendrik Lenstra:
Lattices with symmetry. ISSAC 2013: 3-4 - [p3]Bart de Smit, Hendrik Lenstra:
Standard models for finite fields. Handbook of Finite Fields 2013: 401-404 - 2010
- [j10]Hendrik Lenstra:
Irreducible Cubics Modulo Five. Am. Math. Mon. 117(9): 817-821 (2010) - [p2]Ionica Smeets
, Arjen K. Lenstra, Hendrik Lenstra, László Lovász, Peter van Emde Boas:
The History of the LLL-Algorithm. The LLL Algorithm 2010: 1-17
2000 – 2009
- 2007
- [j9]Daniel J. Bernstein, Hendrik W. Lenstra Jr., Jonathan Pila:
Detecting perfect powers by factoring into coprimes. Math. Comput. 76(257): 385-388 (2007) - 2005
- [i1]Hendrik W. Lenstra Jr., Gadiel Seroussi:
On Hats and other Covers. CoRR abs/cs/0509045 (2005) - 2002
- [c3]Hendrik W. Lenstra Jr.:
Primality Testing with Gaussian Periods. FSTTCS 2002: 1 - 2000
- [j8]Hendrik W. Lenstra Jr.:
Restricting the Order of Elements in a Group: 10684. Am. Math. Mon. 107(8): 755 (2000)
1990 – 1999
- 1992
- [j7]Shuhong Gao, Hendrik W. Lenstra Jr.:
Optimal Normal Bases. Des. Codes Cryptogr. 2(4): 315-323 (1992) - [j6]Hendrik W. Lenstra Jr.:
On the inverse Fermat equation. Discret. Math. 106-107: 329-331 (1992) - 1991
- [j5]Hendrik W. Lenstra Jr.:
On the Chor-Rivest Knapsack Cryptosystem. J. Cryptol. 3(3): 149-155 (1991) - 1990
- [j4]J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr:
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Comb. 10(4): 333-348 (1990) - [c2]Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard:
The Number Field Sieve. STOC 1990: 564-572 - [p1]Arjen K. Lenstra, Hendrik W. Lenstra Jr.:
Algorithms in Number Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 673-716
1980 – 1989
- 1986
- [c1]Leonard M. Adleman, Hendrik W. Lenstra Jr.:
Finding Irreducible Polynomials over Finite Fields. STOC 1986: 350-355 - 1983
- [j3]Hendrik W. Lenstra Jr.:
Integer Programming with a Fixed Number of Variables. Math. Oper. Res. 8(4): 538-548 (1983)
1970 – 1979
- 1979
- [j2]Hendrik W. Lenstra Jr.:
Miller's Primality Test. Inf. Process. Lett. 8(2): 86-88 (1979) - 1972
- [j1]Hendrik W. Lenstra Jr.:
Two theorems on perfect codes. Discret. Math. 3(1-3): 125-132 (1972)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint