|Born||January 29, 1928|
|Died||September 19, 2010(aged 82)|
|Alma mater||Princeton University|
|Thesis||The Theory of Well-Partially-Ordered Sets (1954)|
|Doctoral advisor||Roger Lyndon, Paul Erdős|
|Known for||Kruskal's algorithm, Kruskal's tree theorem, Kruskal–Katona theorem|
Kruskal was born to a Jewish family in New York City to a successful fur wholesaler, Joseph B. Kruskal, Sr. His mother, Lillian Rose Vorhaus Kruskal Oppenheimer, became a noted promoter of Origami during the early era of television.
Kruskal had two notable brothers, Martin David Kruskal, co-inventor of solitons and of surreal numbers, and William Kruskal who developed the Kruskal-Wallis one-way analysis of variance. One of Joseph Kruskal's nephews is computer scientist Clyde Kruskal.
Education and career
He was a student at the University of Chicago earning a bachelor of science in mathematics in the year of 1948, and a master of science in mathematics in the following year 1949. After his time at the University of Chicago Kruskal attended Princeton University, where he completed his Ph.D. in 1954, nominally under Albert W. Tucker and Roger Lyndon, but de facto under Paul Erdős with whom he had two very short conversations. Kruskal has worked on well-quasi-orderings and multidimensional scaling.
He was a Fellow of the American Statistical Association, former president of the Psychometric Society, and former president of the Classification Society of North America. He also initiated and was first president of the Fair Housing Council of South Orange and Maplewood in 1963, and actively supported civil rights in several other organizations such as CORE.
In statistics, Kruskal's most influential work is his seminal contribution to the formulation of multidimensional scaling. In computer science, his best known work is Kruskal's algorithm for computing the minimal spanning tree (MST) of a weighted graph. The algorithm first orders the edges by weight and then proceeds through the ordered list adding an edge to the partial MST provided that adding the new edge does not create a cycle. Minimal spanning trees have applications to the construction and pricing of communication networks. In combinatorics, he is known for Kruskal's tree theorem (1960), which is also interesting from a mathematical logic perspective since it can only be proved nonconstructively. Kruskal also applied his work in linguistics, in an experimental lexicostatistical study of Indo-European languages, together with the linguists Isidore Dyen and Paul Black. Their database is still widely used.
Concepts named after Joseph Kruskal
- Kruskal's algorithm (1956)
- Kruskal's tree theorem (1960)
- Kruskal–Katona theorem (1963)
- Kruskal rank or k-rank (1997)
- American Jewish Archives: "Two Baltic Families Who Came to America The Jacobsons and the Kruskals, 1870-1970" by RICHARD D. BROWN January 24, 1972
- J J O'Connor; E F Robertson. "Kruskal Joseph biography - University of St Andrews". University of St Andrews. Archived from the original on 7 July 2015. Retrieved 2 November 2015.
He was awarded a BS in 1948 and an MS in 1949 by Chicago.
- J.B. Kruskal (May 1960). "Well-Quasi-Ordering, the Tree Theorem, and Vazsonyi's Conjecture" (PDF). Transactions of the American Mathematical Society. 95 (2): 210—225. www.cs.tau.ac.il
- Joseph B. Kruskal (1972). "The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept" (PDF). Journal of Combinatorial Theory (A). 13: 297—305. www.cs.tau.ac.il
- Veterans of the Civil Rights Movement
|Wikimedia Commons has media related to Joseph Kruskal (mathematician).|
- The Dyen, Kruskal and Black lexicostatistical database : the 200-meaning Swadesh lists for 95 Indo-European languages.
- http://cm.bell-labs.com/cm/ms/departments/sia/kruskal/ : his Bell Labs page