R. Kannan. Algorithmic geometry of numbers. Annual Reviews in Computer Science, 2:231--267, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
The Two Faces of Lattices in Cryptology - Nguyen, Stern (2001) (7 citations) (Correct)
Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (12 citations) (Correct)
Approximating Shortest Lattice Vectors is Not.. - Goldreich.. (8 citations) (Correct)
Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (12 citations) (Correct)
On the Hardness of the Shortest Vector Problem - Micciancio (1998) (5 citations) (Correct)
On the Limits of Non-Approximability of Lattice Problems - Goldreich, Goldwasser (1998) (27 citations) (Correct)
On the Hardness of the Shortest Vector Problem - Micciancio (1998) (5 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC