Search results
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.
Robert Tarjan is a distinguished professor of computer science at Princeton University, known for his work on data structures, graph algorithms, and computational complexity. He has received many awards and honors, including the ACM Turing Award, the Rolf Nevanlinna Prize, and the Blaise Pascal Medal.
Robert Tarjan. Professor of Computer Science, Princeton University. Verified email at cs.princeton.edu. data structures graph algorithms analysis of algorithms. Title. Sort. Sort by citations Sort by year Sort by title. Cited by.
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.
People also ask
Who is Robert Tarjan?
How do I contact Robert Tarjan?
Where is Robert E Tarjan Department of Computer Science?
Where is Tarjan a professor?
Robert E. Tarjan is a distinguished professor of computer science at Princeton University. He is known for his research on algorithms, data structures, and graph theory.
Robert Tarjan is a distinguished computer scientist who works on data structures and algorithms. He is a member of several national academies and received the Nevanlinna Prize and the Turing Award for his contributions to the field.
Robert Tarjan is a distinguished professor and a Turing Award winner for his contributions to algorithms and data structures. He has also worked at various academic and industrial research institutions and holds many patents and publications.
