Please select the name from the list. If the name is not there, means it is not connected with a GND -ID?
GND: 108767337
Click on the author name for her/his data, if available
List of co-authors associated with the respective author. The font size represents the frequency of co-authorship.
Click on a term to reduce result list
The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.
b
Match by:
Sort by:
Records:
The information on the author is retrieved from: Entity Facts (by DNB = German National Library data service), DBPedia and Wikidata
László Lovász
Prof. Dr.
Alternative spellings: L. Lovász
B:1948Budapest Biblio: Ungar. Mathematiker, lebte zeitw. in den USA, wo er von 1993 bis 2000 als Professor an der Yale University und von 1999 bis 2006 für Microsoft Research arbeitete, seit 2006 Direktor des Mathematischen Institutes der Loránd-Eötvös-Universität (ELTE) in Budapest
Information about the license status of integrated media files (e.g. pictures or videos) can usually be called up by clicking on the Wikimedia Commons URL above.
László Lovász (Hungarian: [ˈlovaːs ˈlaːsloː ]; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020. 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. He is also one of the eponymous authors of the LLL lattice reduction algorithm. (Source: DBPedia)
Q357918
Publishing years
1
1991
1
1990
1
1989
2
1988
1
1987
3
1986
2
1985
1
1979
Series
Report (8)
Algorithms and combinatorics : study and research texts (2)