25,161
edits
Changes
no edit summary
'''Jon Michael Kleinberg''',<br/>
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 is in particular known for the development of the [https://en.wikipedia.org/wiki/HITS_algorithm HITS algorithm]<ref>[[Jon Kleinberg]] ('''1999'''). ''[http://cs.brown.edu/memex/ACM_HypertextTestbed/papers/10.html Hubs, Authorities, and Communities]''. [[ACM#Surveys|ACM Computing Surveys]], Vol. 31, No. 4</ref>. 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=
* [[Jon Kleinberg]], [[Mathematician#MXGoemans|Michel Goemans]] ('''1998'''). ''[https://epubs.siam.org/doi/abs/10.1137/S0895480195287541?mobileUi=0 The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 11, No. 2, [https://math.mit.edu/~goemans/PAPERS/KleinbergG-1998-TheLovaszThetaFunctionVertexCover.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Lov%C3%A1sz_number Lovász number from Wikipedia]</ref>
* [[Mathematician#MXGoemans|Michel Goemans]], [[Jon Kleinberg]] ('''1998'''). ''[https://link.springer.com/article/10.1007/BF01585867 An improved approximation ratio for the minimum latency problem]''. [https://en.wikipedia.org/wiki/Mathematical_Programming Mathematical Programming], Vol. 82, [http://math.mit.edu/~goemans/PAPERS/latency.pdf pdf]
* [[Jon Kleinberg]] ('''1999'''). ''[http://cs.brown.edu/memex/ACM_HypertextTestbed/papers/10.html Hubs, Authorities, and Communities]''. [[ACM#Surveys|ACM Computing Surveys]], Vol. 31, No. 4<ref>[https://en.wikipedia.org/wiki/HITS_algorithm HITS algorithm from Wikipedia]</ref>
* [[Jon Kleinberg]] ('''1999'''). ''[https://dl.acm.org/doi/10.1145/324133.324140 Authoritative sources in a hyperlinked environment]''. [[ACM#Journal|Journal of the ACM]], Vol. 46, No. 5
==2000 ...==
