Joseph Kruskal


Joseph Kruskal

Joseph Bernard Kruskal, Jr. (born January 29 1928) is an American mathematician, statistician, and psychometrician. He was a student at the University of Chicago and at 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 is 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.

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.

Kruskal was born 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.

Joseph Kruskal should not be confused with his two brothers Martin David Kruskal (1925-2006; co-inventor of solitons and of surreal numbers) and William Kruskal (1919–2005; developed the Kruskal-Wallis one-way analysis of variance).

Concepts named after Joseph Kruskal

* Kruskal's algorithm (1956)
* Kruskal's tree theorem (1960)
* Kruskal–Katona theorem (1963)

External links

*MathGenealogy |id=7714


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Joseph - получить на Академике актуальный промокод на скидку Kupivip RU или выгодно joseph купить с дисконтом на распродаже в Kupivip RU

  • Joseph Kruskal — Pour les articles homonymes, voir Kruskal. Joseph Kruskal (né le 29 janvier 1928, mort le 19 septembre 2010) est un mathématicien, statisticien, chercheur en informatique et psychométricien américain. Articles connexes Algorithme de Kruskal… …   Wikipédia en Français

  • Joseph Kruskal — Joseph B. Kruskal (29 de enero de 1928 – Maplewood, Nueva Jersey, 19 de septiembre de 2010)[1] fue un matemático y estadístico estadounidense. Contenido 1 Biografía 2 …   Wikipedia Español

  • Joseph Kruskal — Joseph Bernard Kruskal (* 29. Januar 1928 in New York City; † 19. September 2010 in Princeton (New Jersey)) war ein US amerikanischer Mathematiker und Statistiker.[1] Er hat an der Universität von Chicago und der Princeton Universität studiert,… …   Deutsch Wikipedia

  • Kruskal's algorithm — is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is… …   Wikipedia

  • Kruskal — puede hacer referencia a: Joseph Kruskal, matemático estadounidense. Martin Kruskal, matemático estadounidense hermano del anterior. William Kruskal, matemático y estadístico estadounidense, hermano de los anteriores. Algoritmo de Kruskal,… …   Wikipedia Español

  • Kruskal — ist der Familienname von: Joseph Kruskal (1929–2010), US amerikanischer Mathematiker und Statistiker Martin Kruskal (1925–2006), US amerikanischer Mathematiker und Physiker William Kruskal (1919–2005), US amerikanischer Mathematiker und… …   Deutsch Wikipedia

  • Kruskal — can refer to any one of three brothers:* William Kruskal (1919 2005), American mathematician and statistician * Martin Kruskal (1925 2006), American mathematician and physicist * Joseph Kruskal (born 1928), American mathematician and computer… …   Wikipedia

  • Kruskal-Algorithmus — Der Algorithmus von Kruskal ist ein Algorithmus der Graphentheorie zur Berechnung minimaler Spannbäume von ungerichteten Graphen. Der Graph muss dazu zusätzlich zusammenhängend, kantengewichtet und endlich sein. Der Algorithmus stammt von Joseph… …   Deutsch Wikipedia

  • Kruskal's tree theorem — In mathematics, Kruskal s tree theorem states that the set of finite trees over a well quasi ordered set of labels is itself well quasi ordered (under homeomorphic embedding). The theorem was proved byharvs|txt=yes|year= 1960 |authorlink=Joseph… …   Wikipedia

  • Kruskal —  Cette page d’homonymie répertorie des personnes (réelles ou fictives) partageant un même patronyme. Kruskal est un nom de famille notamment porté (ou ayant été porté) par : les frères Kruskal (de nationalité américaine), connu tous les …   Wikipédia en Français