25,161
edits
Changes
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..."
'''[[Main Page|Home]] * [[People]] * Jon Kleinberg'''
[[FILE:Jon Kleinberg.jpg|border|right|thumb|240px| Jon Kleinberg <ref>Jon Kleinberg, [http://www.icm2006.org/ ICM, Madrid 2006], [https://en.wikipedia.org/wiki/Mathematical_Research_Institute_of_Oberwolfach Mathematical Research Institute of Oberwolfach], [https://commons.wikimedia.org/wiki/File:Jon_Kleinberg.jpg Photo] by [https://de.wikipedia.org/wiki/Gert-Martin_Greuel Gert-Martin Greuel], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''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]. 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=
<ref>[https://scholar.google.com/citations?user=VX7d5EQAAAAJ&hl=en Jon Kleinberg - Google Scholar]</ref> <ref>[https://dblp.org/pid/k/JonMKleinberg.html dblp: Jon M. Kleinberg]</ref>
==1992 ...==
* [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Mathematician#KKedem|Klara Kedem]], [[Jon Kleinberg]] ('''1992'''). ''[https://dl.acm.org/doi/10.1145/142675.142700 On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane]''. [https://dblp.org/db/conf/compgeom/compgeom92.html#HuttenlocherKK92 SCG 92]
* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''1995'''). ''[https://www.computer.org/csdl/proceedings-article/focs/1995/71830052/12OmNwMobd7 Disjoint Paths in Densely Embedded Graphs]''. [https://dblp.org/db/conf/focs/focs95.html#KleinbergT95 FOCS] 1995, [https://www.cs.cornell.edu/home/kleinber/focs95.pdf pdf]
* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''1995'''). ''[https://dl.acm.org/doi/10.1145/225058.225075 Approximations for the disjoint paths problem in high-diameter planar networks]''. [https://dblp.org/db/conf/stoc/stoc1995.html#KleinbergT95 STOC 1995]
* [[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]]
* [[Jon Kleinberg]] ('''1997'''). ''[https://dl.acm.org/doi/10.1145/258533.258653 Two algorithms for nearest-neighbor search in high dimensions]''. [http://acm-stoc.org/stoc1997/ STOC 97], [http://web.cs.iastate.edu/~honavar/nearest-neighbor-high-dim.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Nearest_neighbor_search Nearest neighbor search from Wikipedia]</ref>
* [[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
* [[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 ...==
* [[Jon Kleinberg]] ('''2000'''). ''[https://dl.acm.org/doi/10.1145/335305.335325 The small-world phenomenon: an algorithmic perspective]''. [https://dblp.org/db/conf/stoc/stoc2000.html#Kleinberg00 STOC 2000], [https://www.cs.cornell.edu/home/kleinber/swn.pdf pdf]
* [[Jon Kleinberg]] ('''2000'''). ''[https://projecteuclid.org/euclid.im/1057768559 Detecting a Network Failure]''. [https://dblp.org/db/conf/focs/focs2000.html#Kleinberg00 FOCS 2000]
* [[Jon Kleinberg]], [[Mathematician#YRabani|Yuval Rabani]], [[Mathematician#ETardos|Éva Tardos]] ('''2001'''). ''[https://dl.acm.org/doi/10.1006/jcss.2001.1752 Fairness in Routing and Load Balancing]''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences JCSS], Vol. 63, No. 1, [https://www.cs.huji.ac.il/~yrabani/Papers/KleinbergRT-JCSS-revised.pdf pdf]
* [http://david-kempe.com/ David Kempe], [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''2001'''). ''[https://dl.acm.org/doi/10.1145/956750.956769 Maximizing the spread of influence through a social network]''. [https://dblp.org/db/conf/kdd/kdd2003.html#KempeKT03 KDD 2003], [https://www.cs.cornell.edu/home/kleinber/kdd03-inf.pdf pdf]
* [[Mathematician#DLibenNowell|David Liben-Nowell]], [[Jon Kleinberg]] ('''2003'''). ''The link prediction problem for social networks''. [https://dblp.org/db/conf/cikm/cikm2003.html#Liben-NowellK03 CIKM 2003], [https://www.cs.cornell.edu/home/kleinber/link-pred.pdf pdf]
* [[Mathematician#JLeskovec|Jure Leskovec]], [[Mathematician#DChakrabarti|Deepayan Chakrabarti]], [[Jon Kleinberg]], [[Mathematician#CNFaloutsos|Christos Faloutsos]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11564126_17 Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication]''. [https://dblp.org/db/conf/pkdd/pkdd2005.html#LeskovecCKF05 PKDD 2005], [https://cs.stanford.edu/~jure/pubs/kronecker-pkdd05.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Kronecker_product Kronecker product from Wikipedia]</ref>
* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''2006'''). ''[https://www.pearson.com/us/higher-education/program/Kleinberg-Algorithm-Design/PGM319216.html Algorithm Design]''. [https://en.wikipedia.org/wiki/Pearson_plc Pearson], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]
==2010 ...==
* [[Mathematician#DAEasley|David A. Easley]], [[Jon Kleinberg]] ('''2010'''). ''[https://www.cs.cornell.edu/home/kleinber/networks-book/ Networks, Crowds, and Markets - Reasoning About a Highly Connected World]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2012'''). ''[https://dl.acm.org/doi/10.1145/2124295.2124378 Effects of user similarity in social media]''. [https://dl.acm.org/doi/proceedings/10.1145/2124295 WSDM '12], [https://www.cs.cornell.edu/home/kleinber/wsdm12-sim.pdf pdf]
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2012'''). ''[https://dl.acm.org/doi/10.1145/2339530.2339665 Discovering value from community activity on focused question answering sites: a case study of stack overflow]''. [[ACM#SIGKDD|ACM SIGKDD 2012]], [https://www.cs.cornell.edu/home/kleinber/kdd12-qa.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Stack_Overflow Stack Overflow from Wikipedia]</ref>
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2013'''). ''Steering user behavior with badges''. [https://en.wikipedia.org/wiki/International_World_Wide_Web_Conference_Committee IW3C2], [https://www.cs.cornell.edu/home/kleinber/www13-badges.pdf pdf]
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2014'''). ''Engaging with Massive Online Courses''. [https://arxiv.org/abs/1403.3100 arXiv:1403.3100]
* [[Ashton Anderson]], [[Jon Kleinberg]], [[Sendhil Mullainathan]] ('''2016'''). ''Assessing Human Error Against a Benchmark of Perfection''. [[ACM#SIGKDD|ACM SIGKDD 2016]], [https://arxiv.org/abs/1606.04956 arXiv:1606.04956]
==2020 ...==
* [[Reid McIlroy-Young]], [[Siddhartha Sen]], [[Jon Kleinberg]], [[Ashton Anderson]] ('''2020'''). ''Aligning Superhuman AI with Human Behavior: Chess as a Model System''. In Proceedings of the 26th [[ACM#SIGKDD|ACM SIGKDD 2020]], [https://arxiv.org/abs/2006.01855 arXiv:2006.01855]
* [[Reid McIlroy-Young]], [[Russell Wang]], [[Siddhartha Sen]], [[Jon Kleinberg]], [[Ashton Anderson]] ('''2020'''). ''Learning Personalized Models of Human Behavior in Chess''. [https://arxiv.org/abs/2008.10086 arXiv:2008.10086]
=External Links=
* [http://www.cs.cornell.edu/home/kleinber/ Jon Kleinberg's Homepage]
* [https://en.wikipedia.org/wiki/Jon_Kleinberg Jon Kleinberg from Wikipedia]
* [https://scholar.google.com/citations?user=VX7d5EQAAAAJ&hl=en Jon Kleinberg - Google Scholar]
* [https://www.mathgenealogy.org/id.php?id=59868 Jon Kleinberg - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Kleinberg]]
[[Category:Chess Programmer|Kleinberg]]
[[FILE:Jon Kleinberg.jpg|border|right|thumb|240px| Jon Kleinberg <ref>Jon Kleinberg, [http://www.icm2006.org/ ICM, Madrid 2006], [https://en.wikipedia.org/wiki/Mathematical_Research_Institute_of_Oberwolfach Mathematical Research Institute of Oberwolfach], [https://commons.wikimedia.org/wiki/File:Jon_Kleinberg.jpg Photo] by [https://de.wikipedia.org/wiki/Gert-Martin_Greuel Gert-Martin Greuel], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''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]. 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=
<ref>[https://scholar.google.com/citations?user=VX7d5EQAAAAJ&hl=en Jon Kleinberg - Google Scholar]</ref> <ref>[https://dblp.org/pid/k/JonMKleinberg.html dblp: Jon M. Kleinberg]</ref>
==1992 ...==
* [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Mathematician#KKedem|Klara Kedem]], [[Jon Kleinberg]] ('''1992'''). ''[https://dl.acm.org/doi/10.1145/142675.142700 On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane]''. [https://dblp.org/db/conf/compgeom/compgeom92.html#HuttenlocherKK92 SCG 92]
* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''1995'''). ''[https://www.computer.org/csdl/proceedings-article/focs/1995/71830052/12OmNwMobd7 Disjoint Paths in Densely Embedded Graphs]''. [https://dblp.org/db/conf/focs/focs95.html#KleinbergT95 FOCS] 1995, [https://www.cs.cornell.edu/home/kleinber/focs95.pdf pdf]
* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''1995'''). ''[https://dl.acm.org/doi/10.1145/225058.225075 Approximations for the disjoint paths problem in high-diameter planar networks]''. [https://dblp.org/db/conf/stoc/stoc1995.html#KleinbergT95 STOC 1995]
* [[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]]
* [[Jon Kleinberg]] ('''1997'''). ''[https://dl.acm.org/doi/10.1145/258533.258653 Two algorithms for nearest-neighbor search in high dimensions]''. [http://acm-stoc.org/stoc1997/ STOC 97], [http://web.cs.iastate.edu/~honavar/nearest-neighbor-high-dim.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Nearest_neighbor_search Nearest neighbor search from Wikipedia]</ref>
* [[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
* [[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 ...==
* [[Jon Kleinberg]] ('''2000'''). ''[https://dl.acm.org/doi/10.1145/335305.335325 The small-world phenomenon: an algorithmic perspective]''. [https://dblp.org/db/conf/stoc/stoc2000.html#Kleinberg00 STOC 2000], [https://www.cs.cornell.edu/home/kleinber/swn.pdf pdf]
* [[Jon Kleinberg]] ('''2000'''). ''[https://projecteuclid.org/euclid.im/1057768559 Detecting a Network Failure]''. [https://dblp.org/db/conf/focs/focs2000.html#Kleinberg00 FOCS 2000]
* [[Jon Kleinberg]], [[Mathematician#YRabani|Yuval Rabani]], [[Mathematician#ETardos|Éva Tardos]] ('''2001'''). ''[https://dl.acm.org/doi/10.1006/jcss.2001.1752 Fairness in Routing and Load Balancing]''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences JCSS], Vol. 63, No. 1, [https://www.cs.huji.ac.il/~yrabani/Papers/KleinbergRT-JCSS-revised.pdf pdf]
* [http://david-kempe.com/ David Kempe], [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''2001'''). ''[https://dl.acm.org/doi/10.1145/956750.956769 Maximizing the spread of influence through a social network]''. [https://dblp.org/db/conf/kdd/kdd2003.html#KempeKT03 KDD 2003], [https://www.cs.cornell.edu/home/kleinber/kdd03-inf.pdf pdf]
* [[Mathematician#DLibenNowell|David Liben-Nowell]], [[Jon Kleinberg]] ('''2003'''). ''The link prediction problem for social networks''. [https://dblp.org/db/conf/cikm/cikm2003.html#Liben-NowellK03 CIKM 2003], [https://www.cs.cornell.edu/home/kleinber/link-pred.pdf pdf]
* [[Mathematician#JLeskovec|Jure Leskovec]], [[Mathematician#DChakrabarti|Deepayan Chakrabarti]], [[Jon Kleinberg]], [[Mathematician#CNFaloutsos|Christos Faloutsos]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11564126_17 Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication]''. [https://dblp.org/db/conf/pkdd/pkdd2005.html#LeskovecCKF05 PKDD 2005], [https://cs.stanford.edu/~jure/pubs/kronecker-pkdd05.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Kronecker_product Kronecker product from Wikipedia]</ref>
* [[Jon Kleinberg]], [[Mathematician#ETardos|Éva Tardos]] ('''2006'''). ''[https://www.pearson.com/us/higher-education/program/Kleinberg-Algorithm-Design/PGM319216.html Algorithm Design]''. [https://en.wikipedia.org/wiki/Pearson_plc Pearson], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]
==2010 ...==
* [[Mathematician#DAEasley|David A. Easley]], [[Jon Kleinberg]] ('''2010'''). ''[https://www.cs.cornell.edu/home/kleinber/networks-book/ Networks, Crowds, and Markets - Reasoning About a Highly Connected World]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2012'''). ''[https://dl.acm.org/doi/10.1145/2124295.2124378 Effects of user similarity in social media]''. [https://dl.acm.org/doi/proceedings/10.1145/2124295 WSDM '12], [https://www.cs.cornell.edu/home/kleinber/wsdm12-sim.pdf pdf]
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2012'''). ''[https://dl.acm.org/doi/10.1145/2339530.2339665 Discovering value from community activity on focused question answering sites: a case study of stack overflow]''. [[ACM#SIGKDD|ACM SIGKDD 2012]], [https://www.cs.cornell.edu/home/kleinber/kdd12-qa.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Stack_Overflow Stack Overflow from Wikipedia]</ref>
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2013'''). ''Steering user behavior with badges''. [https://en.wikipedia.org/wiki/International_World_Wide_Web_Conference_Committee IW3C2], [https://www.cs.cornell.edu/home/kleinber/www13-badges.pdf pdf]
* [[Ashton Anderson]], [[Mathematician#DPHuttenlocher|Daniel Huttenlocher]], [[Jon Kleinberg]], [[Mathematician#JLeskovec|Jure Leskovec]] ('''2014'''). ''Engaging with Massive Online Courses''. [https://arxiv.org/abs/1403.3100 arXiv:1403.3100]
* [[Ashton Anderson]], [[Jon Kleinberg]], [[Sendhil Mullainathan]] ('''2016'''). ''Assessing Human Error Against a Benchmark of Perfection''. [[ACM#SIGKDD|ACM SIGKDD 2016]], [https://arxiv.org/abs/1606.04956 arXiv:1606.04956]
==2020 ...==
* [[Reid McIlroy-Young]], [[Siddhartha Sen]], [[Jon Kleinberg]], [[Ashton Anderson]] ('''2020'''). ''Aligning Superhuman AI with Human Behavior: Chess as a Model System''. In Proceedings of the 26th [[ACM#SIGKDD|ACM SIGKDD 2020]], [https://arxiv.org/abs/2006.01855 arXiv:2006.01855]
* [[Reid McIlroy-Young]], [[Russell Wang]], [[Siddhartha Sen]], [[Jon Kleinberg]], [[Ashton Anderson]] ('''2020'''). ''Learning Personalized Models of Human Behavior in Chess''. [https://arxiv.org/abs/2008.10086 arXiv:2008.10086]
=External Links=
* [http://www.cs.cornell.edu/home/kleinber/ Jon Kleinberg's Homepage]
* [https://en.wikipedia.org/wiki/Jon_Kleinberg Jon Kleinberg from Wikipedia]
* [https://scholar.google.com/citations?user=VX7d5EQAAAAJ&hl=en Jon Kleinberg - Google Scholar]
* [https://www.mathgenealogy.org/id.php?id=59868 Jon Kleinberg - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Kleinberg]]
[[Category:Chess Programmer|Kleinberg]]
