Search the dblp DataBase
Hendrik W. Lenstra Jr.: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Hendrik W. Lenstra Jr.
Primality Testing with Gaussian Periods. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2002, pp:1- [Conf] - Leonard M. Adleman, Hendrik W. Lenstra Jr.
Finding Irreducible Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP]
STOC, 1986, pp:350-355 [Conf] - Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard
The Number Field Sieve [Citation Graph (0, 0)][DBLP]
STOC, 1990, pp:564-572 [Conf] - J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1990, v:10, n:4, pp:333-348 [Journal] - Shuhong Gao, Hendrik W. Lenstra Jr.
Optimal Normal Bases. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 1992, v:2, n:4, pp:315-323 [Journal] - Hendrik W. Lenstra Jr.
Miller's Primality Test. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1979, v:8, n:2, pp:86-88 [Journal] - Hendrik W. Lenstra Jr.
On the Chor-Rivest Knapsack Cryptosystem. [Citation Graph (0, 0)][DBLP]
J. Cryptology, 1991, v:3, n:3, pp:149-155 [Journal]
On Hats and other Covers [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002