Robert Endre Tarjan, born on 30 April 1948 in Pomona, California, is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, the off-line least common ancestors algorithm and a bridge-finding algorithm, and he co-invented both splay trees and Fibonacci heaps. With John Hopcroft he devised the first linear-time planarity testing algorithm, and he gave the key analysis of the disjoint-set data structure. He studied mathematics at the California Institute of Technology and took his PhD in computer science at Stanford in 1972, supervised by Robert Floyd and Donald Knuth. He has taught at Princeton University since 1985, and he and Hopcroft won the 1986 ACM Turing Award.
Facts
Connections
In Branch
Source Robert Tarjan (Wikipedia)
Mentored By
Source Robert Tarjan (Wikipedia)
In the Other Atlases
Same As
Also in Computing Atlas: the same subject.
Also in Science Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Robert Tarjan (Wikipedia)Lead, nationalityQuote, Lead, nationality
is an American computer scientist and mathematician
Sources
1. Robert Tarjan (Wikipedia)
Lead, birth date
born April 30, 1948
Lead, pronoun
He is the discoverer of several graph theory algorithms
Lead, nationality
is an American computer scientist and mathematician
In Branch: Graph Theory, Lead, graph theory
He is the discoverer of several graph theory algorithms
Mentored By: Donald Knuth, Education, Stanford PhD
he was supervised by Robert Floyd and Donald Knuth
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.