Difference between revisions of "Jon Kleinberg"

From Chessprogramming wiki
Jump to: navigation, search
Line 11: Line 11:
 
<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>
 
<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 ...==
 
==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]
+
* [[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] <ref>[https://en.wikipedia.org/wiki/Voronoi_diagram Voronoi diagram from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Hausdorff_distance Hausdorff distance from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Rigid_transformation Rigid transformation from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Davenport%E2%80%93Schinzel_sequence Davenport–Schinzel sequence from Wikipedia]</ref>
 
* [[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://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]], [[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]

Revision as of 19:07, 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