Robert Tarjan

Robert Tarjan is a Professor in the Department of Computer Science at Princeton University. He joined Princeton in 1985 and holds the James S. McDonnell Distinguished University Professor title. Tarjan received doctoral and master’s degrees in computer science from Stanford University in 1972 and 1971, respectively, following a bachelor’s in mathematics from Caltech. His academic career included assistant professorships at Cornell and Stanford, as well as a Miller research fellowship at UC, Berkeley. Tarjan has held research and scientific roles at various institutions, including NEC Research Institute, InterTrust Technologies, Compaq Computer, Hewlett-Packard, and Microsoft. He was awarded the ACM Turing Award in 1986 for his contributions to algorithms and data structures. His research interests include theoretical computer science, with a focus on algorithm design and analysis.

Robert Tarjan is a Professor of Computer Science at Princeton University, known for his foundational contributions to data structures, graph algorithms, and analysis of algorithms. His research focuses on developing efficient algorithms for problems in graph theory, network optimization, and data structure design. Tarjan's work includes pioneering techniques such as Fibonacci heaps, dynamic trees, and planar separator theorems, which have significantly advanced algorithmic efficiency and complexity analysis. His publications often address the design and analysis of algorithms for problems involving graph manipulation, selection, and planarity testing, with an emphasis on achieving optimal time complexity.