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.
Articles 1–20. Professor of Computer Science, Princeton University - Cited by 94,705 - data structures - graph algorithms - analysis of algorithms.
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.
Professor of Computer Science, Princeton University - Cited by 995 - Theory - Algorithms - Data Structures
Robert Endre Tarjan. We consider combinatorial algorithms for the minimum-cost flow problem on networks with unit capacities, and special cases of the problem. Historically, researchers have...
