Awards & Winners

Nevanlinna Prize

Nevanlinna Prize

The Rolf Nevanlinna Prize is awarded once every 4 years at the International Congress of Mathematicians, for outstanding contributions in Mathematical Aspects of Information Sciences including: All mathematical aspects of computer science, including complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence. Scientific computing and numerical analysis. Computational aspects of optimization and control theory. Computer algebra. The prize was established in 1981 by the Executive Committee of the International Mathematical Union IMU and named to honour the Finnish mathematician Rolf Nevanlinna who had died a year earlier. The award consists of a gold medal and cash prize. Like the Fields Medal the prize is targeted at younger mathematicians, and only those younger than 40 on January 1 of the award year are eligible. The medal features a profile of Nevanlinna, the text "Rolf Nevanlinna Prize", and very small characters "RH 83" on its obverse. RH refers to Raimo Heino, the medal's designer, and 83 to the year of first minting. On the reverse, two figures related to the University of Helsinki, the prize sponsor, are engraved. The rim bears the name of the prizewinner.
Date Established : 1981-04

Check all the winners of Nevanlinna Prize presented under Nevanlinna Prize since 1982 .


Daniel Spielman

(For smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing.)

Madhu Sudan

(For his work in advancing the theory of probabilistically checkable proofs\u2014a way to recast a mathematical proof in computer language for additional checks on its validity\u2014and developing error-correcting codes.)

Peter Shor

(For his development of Shor's algorithm.)

Avi Wigderson

(For his work on computational complexity.)

Alexander Razborov

(For introducing the approximation method in proving Boolean circuit lower bounds of some essential algorithmic problems.)

Robert Tarjan

(For outstanding contributions to mathematical aspects of information science.)