Skip to content
Robert Tarjan

Image by MabelAmber on Pixabay · Pixabay License

EntityQ92638· pop 29· linked from 345 articles

Robert Tarjan

Sign in to save

Also known as Robert Endre Tarjan, Robert E. Tarjan, R.E. Tarjan

American computer scientist

Person · Open Library

Works
1

Top works

  • A magyar néptáplálkozás

via Open Library + Wikidata

Music · MusicBrainz

Type
Person
Gender
Female
Origin
Hungary
Active from
1986-07-26

via MusicBrainz · CC0

Key facts

Born
Robert Endre Tarjan , ( 1948-04-30 ) April 30, 1948 (age 78) , Pomona , California , U.S.
Education
California Institute of Technology ( BS ), Stanford University ( MS , PhD )
Known for
Algorithms and data structures
Awards
Paris Kanellakis Award (1999), Turing Award (1986), Nevanlinna Prize (1982)
Fields
Computer science
Institutions
Princeton University , New York University , Stanford University , University of California, Berkeley , Cornell University , Microsoft Research , Intertrust Technologies , Hewlett-Packard , Compaq , NEC Research , Bell Labs
Thesis
An Efficient Planarity Algorithm (1972)
Doctoral advisor
Robert W. Floyd
Other academic advisors
Donald Knuth
Doctoral students
Thomas Lengauer Monika Henzinger Ramesh Sitaraman Daniel Sleator Jeff Westbrook
Website
www .cs .princeton .edu /~ret /

via Wikipedia infobox

Wikidata facts

Image
Bob Tarjan.jpg
Show 4 more facts
date of birth
1948-04-30
Commons category
Robert Tarjan
Erdős number
2
name in native language
Robert Endre Tarjan
Sources (14)

via Wikidata · CC0

~6 min read

Article

Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan joined Princeton University as the James S. McDonnell Distinguished University Professor of Computer Science in 1985. He and John Hopcroft won the 1986 ACM Turing Award.

Personal life and education

Connections

Categories