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
László Lovász
Filter Results1 entry
Connections
Credited
Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
In Field
Source László Lovász (Wikipedia)
Invented
Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
In the Other Atlases
Same As
Also in Mathematics Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Also in Geography Atlas: the nationality of this subject.
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 SourceLászló Lovász (Wikipedia)
In Field: Algorithms and Complexity Theory, LeadQuote, In Field: Algorithms and Complexity Theory, Lead
In graph theory, Lovász's notable contributions include the proofs of Kneser's conjecture and the Lovász local lemma, as well as the formulation of the Erdős-Faber-Lovász conjecture.
View the Source Lenstra-Lenstra-Lovász lattice basis reduction algorithm (Wikipedia)
Credited: Lenstra-Lenstra-Lovasz Algorithm, Lead section
The 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.
Invented: Lenstra-Lenstra-Lovasz Algorithm, Lead section
The 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.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.