John Tukey

John Tukey
John Tukey
Born	June 16, 1915; New Bedford, Massachusetts, U.S.
Died	July 26, 2000 (aged 85); New Brunswick, New Jersey, U.S.
Education	Brown University (BA, MS); Princeton University (PhD);
Known for	Exploratory data analysis; Multiple comparisons problem; Projection pursuit; Box plot; Blackman–Tukey transformation; Cooley–Tukey FFT algorithm; Freeman–Tukey transformation; Siegel–Tukey test; Stone–Tukey theorem; Tukey–Duckworth test; Tukey's range test; Tukey lambda distribution; Tukey's trimean; Tukey's test of additivity; Tukey's lemma; Tukey mean difference plot; Tukey median; Tukey depth; Tukey's biweight function; Tukey's fences; Tukey window; Cepstrum; Flexagon; Median polish; Midhinge; Slash distribution; Theory of conjoint measurement; Coining the term 'bit'; Scagnostics;
Awards	Wilks Memorial Award (1965); National Medal of Science (1973); Shewhart Medal (1976); IEEE Medal of Honor (1982); Deming Medal (1982); Foreign Member of the Royal Society (1991);
	Scientific career
Fields	Topology
Institutions	Bell Labs; Princeton University;
Thesis	On Denumerability in Topology
Doctoral advisor	Solomon Lefschetz
Doctoral students	David R. Brillinger; Kai Lai Chung; Arthur Dempster; Leo Goodman; Karen Kafadar; Paul Meier; Frederick Mosteller; John A. Hartigan;

John Wilder Tukey (/ˈtuːki/; June 16, 1915 – July 26, 2000) was an American mathematician and statistician, best known for the development of the fast Fourier Transform (FFT) algorithm and box plot. The Tukey range test, the Tukey lambda distribution, the Tukey test of additivity, and the Teichmüller–Tukey lemma all bear his name. He is also credited with coining the term bit and the first published use of the word software.

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