Robert Endre Tarjan
| Robert Endre Tarjan | |
|---|---|
 |
|
| Born |
April 30, 1948 Pomona, California |
| Fields | Computer Science |
| Institutions |
Cornell Berkeley Stanford University New York University Princeton University Hewlett-Packard Microsoft Intertrust |
| Alma mater |
Caltech Stanford |
| Thesis | An Efficient Planarity Algorithm (1972) |
| Known for | Algorithms and data structures |
| Notable awards |
Nevanlinna Prize (1982) Turing Award (1986) Paris Kanellakis Award (1999) |
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's off-line lowest common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, and the Chief Scientist at Intertrust Technologies Corporation.
He was born in Pomona, California. His father was a child psychiatrist specializing in mental retardation, and ran a state hospital. As a child, Tarjan read a lot of science fiction, and wanted to be an astronomer. He became interested in mathematics after reading Martin Gardner's mathematical games column in Scientific American. He became seriously interested in math in the eighth grade, thanks to a "very stimulating" teacher.
While he was in high school, Tarjan got a job, where he worked IBM card punch collators. He first worked with real computers while studying astronomy at the Summer Science Program in 1964.
Tarjan obtained a Bachelor's degree in mathematics from the California Institute of Technology in 1969. At Stanford University, he received his master's degree in computer science in 1971 and a Ph.D. in computer science (with a minor in mathematics) in 1972. At Stanford, he was supervised by Robert Floyd and Donald Knuth, both highly prominent computer scientists, and his Ph.D. dissertation was An Efficient Planarity Algorithm. Tarjan selected computer science as his area of interest because he believed that CS was a way of doing mathematics that could have a practical impact.
...
Wikipedia