Difference between revisions of "Jon Kleinberg"

From Chessprogramming wiki
Jump to: navigation, search
Line 21: Line 21:
 
* [[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
 
* [[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 ...==
 
==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://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] <ref>[https://en.wikipedia.org/wiki/Small-world_network Small-world network from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Small-world_experiment Small-world experiment from Wikipedia]</ref>
 
* [[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]] ('''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]
+
* [[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] <ref>[https://en.wikipedia.org/wiki/Routing Routing from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Load_balancing_(computing) Load balancing (computing) from Wikipedia]</ref>
 
* [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]
 
* [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#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]

Revision as of 23:03, 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