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 strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps.

**Robert Tarjan - Wikipedia**https://en.wikipedia.org/wiki/Robert_Tarjan##### Web results:

**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 strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps.**Robert**E.**Tarjan**, the James S. McDonnell Distinguished University Professor of Computer Science, joined Princeton in 1985. He received doctoral and master’s degrees in computer science from Stanford in 1972 and 1971, respectively, after earning a bachelor’s in mathematics from Caltech.i10-index. 311. 175.

**Robert Tarjan**. Professor of Computer Science, Princeton University. Verified email at cs.princeton.edu. data structures graph algorithms analysis of algorithms.**Robert**Endre**Tarjan**, (born April 30, 1948, Pomona, California, U.S.), computer scientist and cowinner of the 1986 A.M. Turing Award, the highest honour in computer science, for “fundamental achievements in the design and analysis of algorithms and data structures.”- Robert E Tarjan, 1986 ACM Turing Award RecipientYouTube
- Robert Tarjan: Search Tree MysteriesYouTube
- 4th HLF – Lecture: Robert TarjanYouTube
- HLFF Shortcuts: Robert TarjanYouTube

**Robert Tarjan**James S. McDonnell Distinguished University Professor of Computer Science. Website: http://www.cs.princeton.edu/~ret/ Email: ret@cs.Princeton.EDU Office ...**Robert**E.**Tarjan**Department of Computer Science Princeton University 35 Olden Street, Room 324 Princeton, NJ 08544-2087 Phone: (609) 270-1355 FAX: (609) 258-1771 ret@cs.princeton.edu Primary professional activities Department of Computer Science, Princeton University James S. McDonnell Distinguished University Professor of Computer Science.**Robert**E.**Tarjan**is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University and the Chief Scientist of Intertrust Technologies. Previously, he held academic positions at NYU, Stanford, UC Berkeley, and Cornell, and industrial research positions at Microsoft, HP, NEC, and Bell Labs.Bob

**Tarjan**was born on April 30, 1948 in Pomona, California. He received a B.S. in mathematics from Caltech in 1969, and was determined to do a Ph.D. but was undecided between mathematics and computer science. He finally chose computer science as a way to use his mathematical skills to solve problems of more practical interest.**Robert Tarjan**Computer Science James. S. McDonnell Distinguished University Professor Computer Science Building 324 8-4797 ret@cs.princeton.edu**Tarjan**'s strongly connected components algorithmis an algorithmin graph theoryfor finding the strongly connected components(SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithmand the path-based strong component algorithm.