Robert Tarjan
1948– — USA
Era: Modern
Brilliance: 9/10 | Stewardship: 8/10 | Composite Index: 72
Graph algorithms architect who shaped modern computer science
"The real problem is that programmers have spent far too much time worrying about efficiency and too little about correctness."
Biography
Robert Tarjan revolutionized algorithmic theory through groundbreaking work on graph algorithms, earning the Turing Award for contributions that became fundamental to computer science. His algorithms for depthfirst search, strongly connected components, and disjoint sets are taught in every computer science program and power systems ranging from compilers to network analysis. Tarjan's work transformed abstract mathematics into practical tools that enable modern computing infrastructure.
Key Facts
- Developed Tarjan's strongly connected components algorithm, a cornerstone of graph theory
- Won the Turing Award in 1986 for fundamental contributions to the design and analysis of algorithms
- Created the disjoint-set (union-find) data structure, essential for spanning tree algorithms
- Published over 100 papers spanning algorithms, data structures, and computational complexity
- Professor at Princeton University's Department of Computer Science; co-founder of Infotech Investment Group
His algorithms power everything from compilers to social networks today
Total BrainCoins: 0
Cast BrainCoins for Robert Tarjan