TODAY - Distinguished Lectures Series - Talk III: Limits of Sparse Graphs: Distributed Algorithms And Group Theory

Speaker:
Prof. László Lovász (Eötvös Loránd University in Budapest, Hungary)
Date:
Thursday, 2.5.2013, 14:30
Place:
Room 337-8 Taub Bld.

The limit theory of bounded-degree graphs is very interesting, but substantially more challenging than the dense theory. Limit objects can be defined in more than one sense; an interesting class of infinite graphs, which are called graphings and have been known from group theory and ergodic theory for a while, can be used to describe limit objects. Algorithmic questions in this theory are closely related to distributed computing in constant time.

The lecture is for mathematically minded audience

Bio:
László Lovász, born in 1948 in Budapest, is a Hungarian-American mathematician, best known for his work in combinatorics, combinatorial optimization, graph theory and their impact on computer science, for which he was awarded the Wolf Prize and the Knuth Prize in 1999, and the Kyoto Prize in 2010. He received the Fulkerson Prize twice (1982, 2012), Hungary's Széchenyi Grand Prize (2008), Bolyai prize (2007), Gödel Prize (2001).

Lovász received his Candidate of Sciences degree in 1970 at Hungarian Academy of Sciences. His advisor was Tibor Gallai. Until 1975, Lovász worked at the Eötvös University, between 1975-1982 he led the Department of Geometry at the University of Szeged.

In 1982 he returned to the Eötvös University, where he created the Department of Computer Science.

Lovász was a professor at Yale University during the 1990s and was a collaborative member of the Microsoft Research Center until 2006. He returned to Eötvös Loránd University, Budapest, where he was the director of the Mathematical Institute (2006-2011). He served as president of the International Mathematical Union between January 1, 2007 and December 31, 2010.

Youtube Interview: Avi Wigderson interviews László Lovász.

Back to the index of events