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.
Es el descubridor de numerosos importantes algoritmos de grafos, incluyendo el Algoritmo de Tarjan del mínimo número de ancestros (Tarjan's off-line least common ancestors algorithm), o los splay trees, junto con Daniel Sleator.
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.
Depth-first search and linear graph algorithms. R Tarjan. SIAM journal on computing 1 (2), 146-160. , 1972. 9411. 1972. Fibonacci heaps and their uses in improved network optimization algorithms. ML Fredman, RE Tarjan. Journal of the ACM (JACM) 34 (3), 596-615.
Professor of Computer Science, Princeton University - Cited by 995 - Theory - Algorithms - Data Structures
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.
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.
