The SCEAS System
Navigation Menu

Search the dblp DataBase


Hendrik W. Lenstra Jr.: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hendrik W. Lenstra Jr.
    Primality Testing with Gaussian Periods. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:1- [Conf]
  2. Leonard M. Adleman, Hendrik W. Lenstra Jr.
    Finding Irreducible Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:350-355 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]

  8. On Hats and other Covers [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002