Difference between revisions of "Jon Kleinberg"

From Chessprogramming wiki
Jump to: navigation, search
Line 28: Line 28:
 
* [[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>
 
* [[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]
 
* [[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]
 +
* [[Mathematician#JLeskovec|Jure Leskovec]], [[Mathematician#DChakrabarti|Deepayan Chakrabarti]], [[Jon Kleinberg]], [[Mathematician#CNFaloutsos|Christos Faloutsos]], [[Mathematician#ZGhahramani|Zoubin Ghahramani]] ('''2008'''). ''Kronecker Graphs: An Approach to Modeling Networks''. [https://arxiv.org/abs/0812.4905 arXiv:0812.4905] <ref>[https://en.wikipedia.org/wiki/Kronecker_graph Kronecker graph from Wikipedia]</ref>
 
==2010 ...==
 
==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]
 
* [[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]
Line 35: Line 36:
 
* [[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]], [[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]
 
* [[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]
 +
* [https://scholar.google.com/citations?user=tiE4g64AAAAJ&hl=en Maithra Raghu], [https://scholar.google.com/citations?user=ZZNxNAYAAAAJ&hl=en Alex Irpan], [[Mathematician#JAndreas|Jacob Andreas]], [[Mathematician#RKleinberg|Robert Kleinberg]], [[Quoc V. Le]], [[Jon Kleinberg]] ('''2017'''). ''Can Deep Reinforcement Learning Solve Erdos-Selfridge-Spencer Games?'' [https://arxiv.org/abs/1711.02301 arXiv:1711.02301]
 
==2020 ...==
 
==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]], [[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]

Revision as of 20:30, 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