Suchergebnisse
Suchergebnisse:
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 Endre „Bob“ Tarjan (* 30. April 1948 in Pomona, Kalifornien) ist ein US-amerikanischer Informatiker. 1986 wurde er zusammen mit John E. Hopcroft für das Design und die Analyse von Algorithmen und Datenstrukturen mit dem Turing Award ausgezeichnet.
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.
Articles 1–20. Professor of Computer Science, Princeton University - Cited by 94,727 - data structures - graph algorithms - analysis of algorithms.
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...
Robert E. Tarjan. Department of Computer Science. Princeton University. 35 Olden Street, Room 324. Princeton, NJ 08544-2087. Phone: (609) 270-1355.
Professor of Computer Science, Princeton University - Cited by 995 - Theory - Algorithms - Data Structures
