Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Laszlo Lovasz

Theory of Computation

Laszlo Lovasz (born March 9, 1948, in Budapest, Hungary) is a Hungarian mathematician and computer scientist, professor emeritus at Eotvos Lorand University and a dual Hungarian and American citizen. His work in combinatorics, graph theory and theoretical computer science includes proving Kneser's conjecture, developing the Lovasz local lemma, formulating the Erdos-Faber-Lovasz conjecture, and co-developing the LLL lattice basis reduction algorithm. He received the Knuth Prize in 1999, the Wolf Prize in Mathematics in 1999, the Godel Prize in 2001, the John von Neumann Theory Prize in 2006, the Kyoto Prize in Basic Sciences in 2010, and the Abel Prize in 2021, the latter shared with Avi Wigderson for foundational contributions to theoretical computer science and discrete mathematics.

Facts
Birth Year
1948 1
Connections

Credited

Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)

Invented

Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
In the Other Atlases
Sources
1. Wikidata: László Lovász
  • Wikidata Q357918, resolved via en.wikipedia pageprops (wave rule R-L)
  • Wikidata Q357918 P569 (date of birth)
View the Source
Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
  • Credited: Lenstra-Lenstra-Lovasz Algorithm, Lead sentence
    Lenstra-Lenstra-Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis \mathbf{B} = \{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{
  • Invented: Lenstra-Lenstra-Lovasz Algorithm, Lead sentence
    Lenstra-Lenstra-Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis \mathbf{B} = \{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.