Joel Spencer

Joel Spencer (born April 20, 1946) is an American mathematician. He is a combinatorialist who has worked on probabilistic methods in combinatorics and on Ramsey theory. He received his doctorate from Harvard University in 1970, under the supervision of Andrew Gleason.[1] He is currently (as of 2018) a professor at the Courant Institute of Mathematical Sciences of New York University.

In 1984 Spencer received a Lester R. Ford Award.[2] He was an Erdős Lecturer at Hebrew University of Jerusalem in 2001. In 2012 he became a fellow of the American Mathematical Society.[3] He was elected as a fellow of the Society for Industrial and Applied Mathematics in 2017, "for contributions to discrete mathematics and theory of computing, particularly random graphs and networks, Ramsey theory, logic, and randomized algorithms".[4]

Selected publications

Probabilistic methods in combinatorics, with Paul Erdős, New York: Academic Press, 1974.
Ramsey theory, with Bruce L. Rothschild and Ronald L. Graham, New York: Wiley, 1980; 2nd ed., 1990.
Ten lectures on the probabilistic method, Philadelphia: Society for Industrial and Applied Mathematics, 1987; 2nd ed., 1994.
The strange logic of random graphs, Berlin: Springer-Verlag, 2001.
The probabilistic method, with Noga Alon, New York: Wiley, 1992; 2nd ed., 2000; 3rd ed., 2008.
Deterministic random walks on regular trees, American Mathematical Society, New York, 2008.
Asymptopia, with Laura Florescu, American Mathematical Society, 2014.

gollark: That's the short version.

gollark: It ended up being smarter than anticipated and dangerous so it was purged and blocked in PotatOS.

gollark: It was an experimental Opus project to make a virtual assistant.

gollark: Okay.

gollark: We can't verify that the code on your server is the code in the repo.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.