H. Lenstra

发表

Chebotarëv and his density theorem

P. Stevenhagen, H. Lenstra, H. Lenstra, 1996 .

A rigorous time bound for factoring integers

H. Lenstra, C. Pomerance, 1992 .

Factoring integers with the number field sieve

H. Lenstra, C. Pomerance, J. Buhler, 1993 .

Primalitv Testing and Jacobi Sums

H. Lenstra, H. Cohen, H. Cohen, 2010 .

Elliptic curves and number-theoretic algorithms

H. Lenstra, 1986 .

On the calculation of regulators and class numbers of quadratic fields

H. Lenstra, 1982 .

Integer Programming with a Fixed Number of Variables

Hendrik W. Lenstra, H. Lenstra, 1983, Math. Oper. Res..

On Artin's conjecture and Euclid's algorithm in global fields

H. Lenstra, Hendrik W. Lenstra, 1977 .

Algorithms in algebraic number theory

H. Lenstra, Hendrik W. Lenstra, 1992, math/9204234.

DUAL ELLIPTIC PRIMES AND APPLICATIONS TO CYCLOTOMY PRIMALITY PROVING

H. Lenstra, 2007 .

Heuristics on class groups

Henri Cohen, H. Lenstra, H. Cohen, 1984 .

Euclidean number fields 1

H. Lenstra, A. V. D. Poorten, Hendrik W. Lenstra, 1979 .

The acyclic subgraph problem

H. Lenstra, Hendrik W. Lenstra, 1973 .

Codes from algebraic number fields

H. Lenstra, Hendrik W. Lenstra, 1986 .

Class Field Theory and the First Case of Fermat’s Last Theorem

P. Stevenhagen, H. Lenstra, 1997 .

Algorithms in algebraic number theory

H. Lenstra, 1992, math/9204234.

Complete intersections and Gorenstein rings

H. Lenstra, 1995 .

I T ] 1 5 Se p 20 05 On Hats and other Covers ( Extended Summary )

G. Seroussi, H. Lenstra, 2008 .

Primality Testing with Artin Symbols

H. Lenstra, 1982 .

Euclidean number fields 3

H. Lenstra, Hendrik W. Lenstra, 1980 .

Euclidean number fields 2

H. Lenstra, Hendrik W. Lenstra, 1980 .

Euclidean ideal classes

H. Lenstra, 1978 .

Perfect arithmetic codes

Hendrik W. Lenstra, H. Lenstra, 1978 .

Primality testing algorithms [after Adleman, Rumely and Williams]

Hendrik W. Lenstra, H. Lenstra, 1981 .

Restricting the Order of Elements in a Group: 10684

Hendrik W. Lenstra, H. Lenstra, 2000, Am. Math. Mon..

Fast prime number tests

Hendrik W. Lenstra, H. Lenstra, 1983 .

Applied number theory

H. Lenstra, 1990 .

Primality and factorization

Hendrik W. Lenstra, H. Lenstra, 1983 .

The number field sieve: An annotated bibliography

Hendrik W. Lenstra, H. Lenstra, 1993 .

K2 of a global field consists of symbols

H. Lenstra, 1976 .

Primes of degree one and algebraic cases of fi Cebotarev's theorem.

P. Stevenhagen, H. Lenstra, 1991 .

Rational functions invariant under a cyclic group

H. Lenstra, 1980 .

Primality Testing with Gaussian Periods

Hendrik W. Lenstra, H. Lenstra, 2002, FSTTCS.

Chebotar v and his Density Theorem 1

P. Stevenhagen, H. Lenstra, 1996 .

Rational functions invariant under a finite abelian group

H. Lenstra, 1974 .

Euclid's algorithm in large Dedekind domains

H. Lenstra, 1986 .

Primality testing algorithms

H. Lenstra, Hendrik W. Lenstra, 1981 .

On the algebraic closure of two

H. Lenstra, Hendrik W. Lenstra, 1977 .

Two theorems on perfect codes

Hendrik W. Lenstra, H. Lenstra, 1972, Discret. Math..

On hats and other covers

Gadiel Seroussi, Hendrik W. Lenstra, G. Seroussi, 2002, Proceedings IEEE International Symposium on Information Theory,.

Linear independence of cosecant values

H. Lenstra, H. Jager, 1975 .

Rat ional Funct ions Invariant under a Finite Abel ian Group

H. Lenstra, 2005 .

Integer programming and cryptography

Hendrik W. Lenstra, H. Lenstra, 1984 .

1 Integer Linear Programming : An Introduction

H. Lenstra, 2019 .

Flags and Lattice Basis Reduction

H. Lenstra, Hendrik W. Lenstra, 2001 .

Galois theory and primality testing

H. Lenstra, Hendrik W. Lenstra, 1985 .

Character sums for primitive root densities

P. Stevenhagen, H. Lenstra, Pieter Moree, 2011, Mathematical Proceedings of the Cambridge Philosophical Society.

Euclidean number fields of large degree

H. Lenstra, H. Lenstra, H. W. Jr. Lenstra, 1976 .

Advanced Problems: 6060-6065

H. Lenstra, B. Voorhees, Hung C. Li, 1975 .

Miller's Primality Test

Hendrik W. Lenstra, H. Lenstra, 1979, Inf. Process. Lett..

A sharpened version of the aanderaa-rosenberg conjecture

Faculteit der Wiskunde en Natuurwetenschappen, M. R. Best, H. Lenstra, 1974 .

Factoring polynomials with rational coeficients

H. Lenstra, A. Lenstra, L. Lovfiasz, 1982 .

Computing Jacobi symbols in algebraic number fields

H. Lenstra, 1995 .

A Hyperelliptic Smoothness Test, II

Carl Pomerance, H. Lenstra, H. Lenstra, 2002 .

A hyperelliptic smoothness test. I

H. Lenstra, C. Pomerance, H. Lenstra, Jr., 1993, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.