• 検索結果がありません。

Rolf Nevanlinna Nevanlinna Prize Prize

N/A
N/A
Protected

Academic year: 2022

シェア "Rolf Nevanlinna Nevanlinna Prize Prize"

Copied!
7
0
0

読み込み中.... (全文を見る)

全文

(1)

Rolf

Rolf Nevanlinna Nevanlinna Prize Prize

Opening

Opening Ceremony Ceremony

International Congress of Mathematicians International Congress of Mathematicians

Madrid

Madrid , Spain , Spain

August 22, 2006

August 22, 2006

(2)

The Rolf

The Rolf Nevanlinna Nevanlinna Prize Prize is awarded by the is awarded by the International Mathematical Union for

International Mathematical Union for

outstanding contributions in outstanding contributions in

mathematical aspects of mathematical aspects of

information

information sciences sciences

„„ First awarded in 1982First awarded in 1982

„„ The winnerThe winner’’s 40s 40thth birthday must occur on or birthday must occur on or after January 1, 2006

after January 1, 2006

(3)

Nevanlinna

Nevanlinna Prize Committee Prize Committee

„„

Samson Samson Abramsky Abramsky (United Kingdom) (United Kingdom)

„„

Franco Franco Brezzi Brezzi (Italy) (Italy)

„„

Gert Gert - - Martin Greuel Martin (Germany) (Germany)

„„

Johan Johan H H å å stad stad (Sweden) (Sweden)

„„

Margaret Wright (USA, chair) Margaret Wright (USA, chair)

(4)

The International Mathematical Union The International Mathematical Union awards the 2006 Rolf

awards the 2006 Rolf NevanlinnaNevanlinna Prize toPrize to

Professor Jon M. Kleinberg Professor Jon M. Kleinberg

Computer Science Department Computer Science Department

Cornell University Cornell University

New York, USA New York, USA

Date of birth: October 1971

Date of birth: October 1971

(5)

The The Nevanlinna Nevanlinna Prize citation Prize citation

For deep, creative and insightful contributions to the For deep, creative and insightful contributions to the

mathematical theory of the global information mathematical theory of the global information

environment, including environment, including

„„ the influential the influential hubs and authoritieshubs and authorities algorithm; algorithm;

„„ methods for discovering short chains in large social methods for discovering short chains in large social networks;

networks;

„„ techniques for modeling, identifying and analyzing bursts techniques for modeling, identifying and analyzing bursts in data streams;

in data streams;

„„ theoretical models of community growth in social theoretical models of community growth in social

(6)

Jon Kleinberg

Jon Kleinberg

(7)

More on Jon Kleinberg

More on Jon Kleinberg s work s work

Kleinberg

Kleinberg’’s combination of mathematical s combination of mathematical ability, superb taste in interesting problems, ability, superb taste in interesting problems,

breadth of interests, and sense of strategy is both breadth of interests, and sense of strategy is both

dazzling and unmatched. His work has had a dazzling and unmatched. His work has had a

fundamental impact on the effectiveness of fundamental impact on the effectiveness of

today

today’’s most advanced Web search engines, and s most advanced Web search engines, and his mathematical insights have had application to his mathematical insights have had application to

Internet routing, data mining, discrete Internet routing, data mining, discrete

参照

関連したドキュメント

In this paper we consider probability logic suitable for reasoning about conditional probability that is based on Kolmogorov’s approach, allowing the iterations of

Prize-collecting survivable network design in node-weighted graphs. Spider Covers for Prize-Collecting Network

start, i.e. the time to start this maximum effort, in order to minimize our objective functional. Calling ˜ t the central epoch we summarize our results in the following: If

We also consider a similar optimization problem on a complete bipartite metric graph including the limiting case when the number of leafs is increasing

There has been considerable interest in partial differential equations solvable by inverse scattering, the so-called soliton equations, since the discovery in 1967 by Gard- ner,

If one is not interested in any of the side issues discussed in [1], a very short proof is possible, in the slightly more general context of a regular Goursat category.. The method

The first laureate of the newly created Gauss prize for applications of mathematics is the Japanese mathematician Kiyoshi Itô, 90.. The prize will be awarded at the opening

For a positive integer n, we write P (n) for the largest prime factor of n, ω(n) for the number of distinct prime divisors of n, and τ(n) for the total number of positive