12 Facts About Jon Kleinberg

Jon Michael Kleinberg was born on 1971 and is an American computer scientist and the Tisch University Professor of Computer Science and Information Science at Cornell University known for his work in algorithms and networks.

Jon Kleinberg is a recipient of the Nevanlinna Prize by the International Mathematical Union.

Jon Kleinberg was born in 1971 in Boston, Massachusetts to a mathematics professor father and a computer consultant mother.

Jon Kleinberg received a Bachelor of Science degree in computer science from Cornell University in 1993 and a PhD from Massachusetts Institute of Technology in 1996.

Jon Kleinberg is the older brother of fellow Cornell computer scientist Robert Kleinberg.

Since 1996 Kleinberg has been a professor in the Department of Computer Science at Cornell, as well as a visiting scientist at IBM's Almaden Research Center.

Jon Kleinberg is a member of the National Academy of Engineering and the American Academy of Arts and Sciences.

Jon Kleinberg realized that this generalization implies two different classes of important web pages, which he called "hubs" and "authorities".

Jon Kleinberg is known for his work on algorithmic aspects of the small world experiment.

Jon Kleinberg was one of the first to realize that Stanley Milgram's famous "six degrees" letter-passing experiment implied not only that there are short paths between individuals in social networks but that people seem to be good at finding those paths, an apparently simple observation that turns out to have profound implications for the structure of the networks in question.

The formal model in which Jon Kleinberg studied this question is a two dimensional grid, where each node has both short-range connections to neighbours in the grid and long-range connections to nodes further apart.

Jon Kleinberg has written numerous papers and articles as well as a textbook on computer algorithms, Algorithm Design, co-authored the first edition with Eva Tardos and sole authored the second edition.