Sign In

Login

Password

Forgot Password ? Sign Up

Lenstra–Lenstra–Lovász lattice basis reduction algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Lenstra–Lenstra–Lovász lattice basis reduction algorithm" in English language version.

refsWebsite
Global rank English rank
5doi.org
2nd place
2nd place
3semanticscholar.org
11th place
8th place
1psu.edu
207th place
136th place
1handle.net
102nd place
76th place
1ams.org
451st place
277th place
1auckland.ac.nz
4,539th place
2,858th place
1acm.org
1,185th place
840th place
1umn.edu
1,266th place
860th place
1cnrs.fr
2,402nd place
5,549th place
1nyu.edu
1,174th place
773rd place
1brown.edu
2,481st place
1,558th place
1ru.nl
9,179th place
6,972nd place

acm.org

dl.acm.org

ams.org

mathscinet.ams.org

  • Lenstra, A. K.; Lenstra, H. W. Jr.; Lovász, L. (1982). "Factoring polynomials with rational coefficients". Mathematische Annalen. 261 (4): 515–534. CiteSeerX 10.1.1.310.318. doi:10.1007/BF01457454. hdl:1887/3810. MR 0682664. S2CID 5701340.

auckland.ac.nz

math.auckland.ac.nz

  • Galbraith, Steven (2012). "chapter 17". Mathematics of Public Key Cryptography.

brown.edu

math.brown.edu

cnrs.fr

simond.users.lmno.cnrs.fr

doi.org

  • Lenstra, A. K.; Lenstra, H. W. Jr.; Lovász, L. (1982). "Factoring polynomials with rational coefficients". Mathematische Annalen. 261 (4): 515–534. CiteSeerX 10.1.1.310.318. doi:10.1007/BF01457454. hdl:1887/3810. MR 0682664. S2CID 5701340.
  • Nguyen, Phong Q.; Stehlè, Damien (September 2009). "An LLL Algorithm with Quadratic Complexity". SIAM J. Comput. 39 (3): 874–903. doi:10.1137/070705702. Retrieved 3 June 2019.
  • Nguyen, Phong Q.; Stehlé, Damien (1 October 2009). "Low-dimensional lattice basis reduction revisited". ACM Transactions on Algorithms. 5 (4): 1–48. doi:10.1145/1597036.1597050. S2CID 10583820.
  • Odlyzko, Andrew; te Reile, Herman J. J. "Disproving Mertens Conjecture" (PDF). Journal für die reine und angewandte Mathematik. 357: 138–160. doi:10.1515/crll.1985.357.138. S2CID 13016831. Retrieved 27 January 2020.
  • Divasón, Jose (2018). "A Formalization of the LLL Basis Reduction Algorithm". Interactive Theorem Proving: 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings. Lecture Notes in Computer Science. Vol. 10895. pp. 160–177. doi:10.1007/978-3-319-94821-8_10. ISBN 978-3-319-94820-1.

handle.net

hdl.handle.net

  • Lenstra, A. K.; Lenstra, H. W. Jr.; Lovász, L. (1982). "Factoring polynomials with rational coefficients". Mathematische Annalen. 261 (4): 515–534. CiteSeerX 10.1.1.310.318. doi:10.1007/BF01457454. hdl:1887/3810. MR 0682664. S2CID 5701340.

nyu.edu

cims.nyu.edu

psu.edu

citeseerx.ist.psu.edu

  • Lenstra, A. K.; Lenstra, H. W. Jr.; Lovász, L. (1982). "Factoring polynomials with rational coefficients". Mathematische Annalen. 261 (4): 515–534. CiteSeerX 10.1.1.310.318. doi:10.1007/BF01457454. hdl:1887/3810. MR 0682664. S2CID 5701340.

ru.nl

math.ru.nl

  • Bosma, Wieb. "4. LLL" (PDF). Lecture notes. Retrieved 28 February 2010.

semanticscholar.org

api.semanticscholar.org

  • Lenstra, A. K.; Lenstra, H. W. Jr.; Lovász, L. (1982). "Factoring polynomials with rational coefficients". Mathematische Annalen. 261 (4): 515–534. CiteSeerX 10.1.1.310.318. doi:10.1007/BF01457454. hdl:1887/3810. MR 0682664. S2CID 5701340.
  • Nguyen, Phong Q.; Stehlé, Damien (1 October 2009). "Low-dimensional lattice basis reduction revisited". ACM Transactions on Algorithms. 5 (4): 1–48. doi:10.1145/1597036.1597050. S2CID 10583820.
  • Odlyzko, Andrew; te Reile, Herman J. J. "Disproving Mertens Conjecture" (PDF). Journal für die reine und angewandte Mathematik. 357: 138–160. doi:10.1515/crll.1985.357.138. S2CID 13016831. Retrieved 27 January 2020.

umn.edu

dtc.umn.edu