Difference between revisions of "Jon Kleinberg"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Jon Kleinberg''' FILE:Jon Kleinberg.jpg|border|right|thumb|240px| Jon Kleinberg <ref>Jon Kleinberg, [http://www.icm2006.org/ ICM, Madri...")
 
Line 6: Line 6:
 
an American mathematician, computer scientist and professor at [https://en.wikipedia.org/wiki/Cornell_University Cornell University]. His research focuses on the interaction of [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Complex_network networks],  
 
an American mathematician, computer scientist and professor at [https://en.wikipedia.org/wiki/Cornell_University Cornell University]. His research focuses on the interaction of [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Complex_network networks],  
 
and the roles they play in large-scale social and information systems. He defended his Ph.D. thesis on ''Approximation Algorithms for Disjoint Paths Problems'' in 1996 at [[Massachusetts Institute of Technology]] under [[Mathematician#MXGoemans|Michel Goemans]] <ref>[[Jon Kleinberg]] ('''1996'''). ''[https://dl.acm.org/doi/book/10.5555/923845 Approximation Algorithms for Disjoint Paths Problems]''. Ph.D. thesis, [[Massachusetts Institute of Technology]], advisor [[Mathematician#MXGoemans|Michel Goemans]]</ref>,
 
and the roles they play in large-scale social and information systems. He defended his Ph.D. thesis on ''Approximation Algorithms for Disjoint Paths Problems'' in 1996 at [[Massachusetts Institute of Technology]] under [[Mathematician#MXGoemans|Michel Goemans]] <ref>[[Jon Kleinberg]] ('''1996'''). ''[https://dl.acm.org/doi/book/10.5555/923845 Approximation Algorithms for Disjoint Paths Problems]''. Ph.D. thesis, [[Massachusetts Institute of Technology]], advisor [[Mathematician#MXGoemans|Michel Goemans]]</ref>,
and is in particular known for the development of the [https://en.wikipedia.org/wiki/HITS_algorithm HITS algorithm]. Along with [[Reid McIlroy-Young]], [[Russell Wang]], [[Siddhartha Sen]] and [[Ashton Anderson]],Jon Kleinberg is involved in the [[Maia Chess]] project of a human-like [[Neural Networks|neural network]] chess engine <ref>[https://maiachess.com/ Maia Chess]</ref>.
+
and is in particular known for the development of the [https://en.wikipedia.org/wiki/HITS_algorithm HITS algorithm]. Along with [[Reid McIlroy-Young]], [[Russell Wang]], [[Siddhartha Sen]] and [[Ashton Anderson]], Jon Kleinberg is involved in the [[Maia Chess]] project of a human-like [[Neural Networks|neural network]] chess engine <ref>[https://maiachess.com/ Maia Chess]</ref>.
  
 
=Selected Publications=
 
=Selected Publications=

Revision as of 18:34, 7 December 2020

Home * People * Jon Kleinberg

Jon Kleinberg [1]

Jon Michael Kleinberg,
an American mathematician, computer scientist and professor at Cornell University. His research focuses on the interaction of algorithms and networks, and the roles they play in large-scale social and information systems. He defended his Ph.D. thesis on Approximation Algorithms for Disjoint Paths Problems in 1996 at Massachusetts Institute of Technology under Michel Goemans [2], and is in particular known for the development of the HITS algorithm. Along with Reid McIlroy-Young, Russell Wang, Siddhartha Sen and Ashton Anderson, Jon Kleinberg is involved in the Maia Chess project of a human-like neural network chess engine [3].

Selected Publications

[4] [5]

1992 ...

2000 ...

2010 ...

2020 ...

External Links

References

Up one level