Robert Tarjan

Robert Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University. His research focuses on fundamental algorithms and data structures including graph algorithms, heap structures, and computational complexity.

Recent work develops efficient data structures (heaps, resizable arrays) and analyzes algorithm optimality, especially in graph traversal and pathfinding. Maintains strong emphasis on theoretical foundations and performance proofs.

Key contributions include refinements to Dijkstra's algorithm, Fibonacci heaps, and tree structures. Research consistently advances theoretical computer science with practical implications for computational efficiency.