Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a225303feb1179f3

Jump to content

// Workers AI · dad joke modeWhat did Robert C. Prim say to the tree? "You're a prime example.

From Wikipedia, the free encyclopedia
(Redirected from Robert Prim)

Robert Clay Prim III (September 25, 1921 – November 18, 2021) was an American mathematician and computer scientist.

Biography

[edit]

Robert Clay Prim III was born in Sweetwater, Texas on September 25, 1921.[1] In 1941, Prim received his B.S. in Electrical Engineering from The University of Texas at Austin,[2] where he also met his wife Alice (Hutter) Prim (1921–2009), whom he married in 1942. Later in 1949, he received his Ph.D. in Mathematics from Princeton University, where he also worked as a research associate from 1948 until 1949.

During the climax of World War II (1941–1944), Prim worked as an engineer for General Electric. From 1944 until 1949, he was hired by the United States Naval Ordnance Lab as an engineer and later a mathematician. At Bell Laboratories, he served as director of mathematics research from 1958 to 1961. There, Prim developed Prim's algorithm. Also during his tenure at Bell Labs, Robert Prim assisted the Weapons Reliability Committee at Sandia National Laboratory chaired by Walter McNair in 1951.[3] After Bell Laboratories, Prim became vice president of research at Sandia National Laboratories.

During his career at Bell Laboratories, Robert Prim along with coworker Joseph Kruskal developed two different algorithms (see greedy algorithm) for finding a minimum spanning tree in a weighted graph, a basic stumbling block in computer network design. His self-named algorithm, Prim's algorithm, was originally discovered in 1930 by mathematician Vojtěch Jarník and later independently by Prim in 1957. It was later rediscovered by Edsger Dijkstra in 1959. It is sometimes referred to as the DJP algorithm or the Jarník algorithm.

Prim was also the co-developer of Prim–Read theory, a game theory concept that calculates the best possible anti-ballistic missile (ABM) defensive layout. This demonstrated that the cost of the defence was always dramatically more than the offensive missiles needed to overwhelm it, and was one of the major reasons the US did not deploy an ABM system at the time.

Robert C. Prim died in San Clemente, California on November 18, 2021, at the age of 100.[4]

See also

[edit]

References

[edit]
  1. "Texas Birth Index, Nolan County, 1903-1997".
  2. Obituary (February 22, 2009). "Alice (Hutter) Prim In Memoriam". Austin American-Statesmen. Retrieved May 3, 2013.
  3. Leland Johnson (1997). "A History of Exceptional Service in the National Interest" (PDF). Retrieved July 20, 2016.
  4. "Robert Prim". Forever Missed. Retrieved 30 July 2023.
[edit]