Robert Endre Tarjan  

Born  Pomona, California 
April 30, 1948
Fields  Computer Science 
Institutions  Cornell Berkeley Stanford University New York University Princeton University HewlettPackard 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 offline least common ancestors algorithm, and coinventor 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.^{[1]}
He was born in Pomona, California. His father was a child psychiatrist specializing in mental retardation, and ran a state hospital.^{[2]} 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.^{[3]}
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.^{[2]}
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^{[4]} and Donald Knuth,^{[5]} 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.^{[6]}
Tarjan has been teaching at Princeton University since 1985.^{[6]} He has also held academic positions at Cornell University (1972–73), University of California, Berkeley (1973–1975), Stanford University (1974–1980), and New York University (1981–1985). He has also been a fellow of the NEC Research Institute (1989–1997).^{[7]} In April 2013 he joined Microsoft Research Silicon Valley in addition to the position at Princeton. In October 2014 he rejoined Intertrust Technologies as chief scientist.
Tarjan has worked at AT&T Bell Labs (1980–1989), Intertrust Technologies (1997–2001, 2014–present), Compaq (2002) and Hewlett Packard (2006–2013).
Tarjan is known for his pioneering work on graph theory algorithms and data structures. Some of his wellknown algorithms include Tarjan's offline least common ancestors algorithm, and Tarjan's strongly connected components algorithm, and he was one of five coauthors of the median of medians linear time selection algorithm. The HopcroftTarjan planarity testing algorithm was the first lineartime algorithm for planaritytesting.^{[8]}
Tarjan has also developed important data structures such as the Fibonacci heap (a heap data structure consisting of a forest of trees), and the splay tree (a selfadjusting binary search tree; coinvented by Tarjan and Daniel Sleator). Another significant contribution was the analysis of the disjointset data structure; he was the first to prove the optimal runtime involving the inverse Ackermann function.
Tarjan received the Turing Award jointly with John Hopcroft in 1986. The citation for the award states^{[7]} that it was:
For fundamental achievements in the design and analysis of algorithms and data structures.
Tarjan was also elected an ACM Fellow in 1994. The citation for this award states:^{[9]}
For seminal advances in the design and analysis of data structures and algorithms.
Some of the other awards for Tarjan include:
Tarjan holds at least 18 U.S. patents.^{[12]} These include:


