Robert Endre Tarjan is an American computer scientist and mathematician who earned his PhD in computer science from Stanford University in 1972 under Robert W. Floyd, and who has served since 1985 as the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University. Tarjan developed a widely used algorithm for finding the strongly connected components of a directed graph, and with John Hopcroft he created the first linear-time algorithm for testing whether a graph is planar. He also co-invented splay trees and Fibonacci heaps, two influential data structures that improved the efficiency of a wide range of algorithms for searching, sorting and network optimization. Tarjan shared the ACM Turing Award with Hopcroft in 1986 for fundamental achievements in the design and analysis of algorithms and data structures, and he also received the Nevanlinna Prize in 1982 and the Paris Kanellakis Award in 1999.
Facts
Birth YearSourced to the subject's own account Birth DateSourced to the subject's own account FieldSourced to the subject's own accountTheoretical computer science and combinatorial algorithms 1 NationalitySourced to the subject's own account Notable WorkSourced to the subject's own accountDiscovered Tarjan's strongly connected components algorithm and co-invented splay trees and Fibonacci heaps; shared the 1986 ACM Turing Award with John Hopcroft. 1 BirthplaceSourced to the subject's own accountPomona, California, U.S. 1 In the Other Atlases
Sources
1. Wikipedia: Robert Tarjan
Wikipedialead section
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician.
infobox: Born
Pomona, California, U.S.
lead section (algorithms)
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.
lead section (Turing Award)
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.
View the Source Reader 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.