Travel and border information for Norway in Norwegian / English

Traveling to Norway? - Register your arrival in our traveler registry
(About the registry)

Abel prize 2021
A brilliant mathematician since his teens, László Lovász has more than delivered on his early promise. His work has established connections between discrete mathematics and computer science.

Abel Prize 2021

Lovász and Wigderson have been awarded the Abel Prize 2021 for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics.

The Abel Prize for 2021 has been awarded to László Lovász of Eötvös Loránd University in Budapest, Hungary, and Avi Wigderson of the Institute for Advanced Study, Princeton, USA by the Norwegian Academy of Science and Letters for "their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics."

The theory of ‘computational complexity’ – which concerns itself with the speed and efficiency of algorithms – first emerged in the 1970s and is now an established field of both mathematics and theoretical computer science. Computational complexity is now a very important field, providing the theoretical basis for internet security. Also in the 1970s, a new generation of mathematicians realised that discrete mathematics had a new area of application in computer science. Today algorithms and internet security applications are an integral part of everyday life for all of us. The work of László Lovász and Avi Wigderson has played an important part in this development.

“Lovász and Wigderson have been leading forces in this development over the last few decades. Their work interlaces in many ways, and, in particular, they have both made fundamental contributions to understanding randomness in computation and in exploring the boundaries of efficient computation,” says Hans Munthe-Kaas, chair of the Abel Committee.

He continues: “Thanks to the ground-breaking work of these two, discrete mathematics and the relatively young field of theoretical computer science are now firmly established as central areas of modern mathematics.”

 

László Lovász
A brilliant mathematician since his teens, László Lovász has more than delivered on his early promise. His work has established connections between discrete mathematics and computer science. Born in 1948 in Budapest, Hungary, he has also served his community as a writer of books, noted for their clarity and accessibility, as an inspirational lecturer, and as a leader, spending a term as president of the International Mathematical Union (2007–2010).

In the 1970s, graph theory became one of the first areas of pure mathematics able to illuminate the new field of computational complexity. One of the major impacts of Lovász’s work has been to establish ways in which discrete mathematics can address fundamental theoretical questions in computer science. He has said that he feels very lucky to have experienced one of those periods when mathematics was developing in complete alignment with an area of application.

In addition to his work on the foundational underpinning of computer science, Lovász has also devised powerful algorithms with wide-ranging applications. One of these, the LLL algorithm, named after Lovász and the brothers Arjen and Hendrik Lenstra, represented a conceptual breakthrough in the understanding of lattices, and has had remarkable applications in areas including number theory, cryptography and mobile computing. Currently, the only known encryption systems that can withstand an attack by a quantum computer are based on the LLL algorithm.

Lovász has won many awards including the 1999 Wolf Prize, the 1999 Knuth Prize, the 2001 Gödel Prize and the 2010 Kyoto Prize.

 

Wigderson

Avi Wigderson

Wigderson is known for his ability to see connections between apparently unrelated areas. He has deepened the connections between mathematics and computer science. He was born in Haifa, Israel, in 1956. His contribution to widening and deepening the field of ‘complexity theory’ – which concerns itself with the speed and efficiency of algorithms – is arguably greater than that of any single other person.

Wigderson has conducted research into every major open problem in complexity theory. In many ways, the field has evolved around him. He has co-authored papers with more than 100 people and has deepened the connections between mathematics and computer science.

The most important present-day application of complexity theory is internet cryptography. Early in his career, Wigderson made fundamental contributions in this area, including the zero-knowledge proof, which is now used in cryptocurrency technology.

In 1994, Wigderson won the Rolf Nevanlinna Prize for computer science. Among his many other awards are the 2009 Gödel Prize and the 2019 Knuth Prize.

About the Abel Prize

  • The ceremony to honour the Abel Prize laureates will be announced at a later date.
  • The Abel Prize is funded by the Norwegian Government and amounts to NOK 7.5 million.
  • The prize is awarded by the Norwegian Academy of Science and Letters.
  • The choice of the Abel laureates is based on the recommendation of the Abel Committee, which is composed of five internationally recognised mathematicians.

• For more information, please visit www.abelprize.no