Robert Tarjan

Robert Tarjan is an American computer scientist noted for foundational work in algorithms, data structures, and graph theory. He developed techniques and algorithms that transformed research at institutions such as Bell Labs and Princeton University, influencing fields from computational complexity to network flow and combinatorial optimization. Tarjan's work has close connections to many prominent figures and concepts in computer science, including Donald Knuth, John Hopcroft, Michael Rabin, Richard Karp, and results like the Ford–Fulkerson algorithm and Dijkstra's algorithm.

Early life and education

Tarjan was born in 1948 and raised in the United States, studying mathematics and computer science at Rutgers University before pursuing graduate research at Princeton University. At Princeton University he completed doctoral work under the supervision of Donald Knuth, engaging with communities around algorithm analysis and data structures linked to researchers such as Robert Sedgewick, Jon Kleinberg, and Éva Tardos. His doctoral period overlapped with major developments in complexity theory and interactions with conferences like the ACM Symposium on Theory of Computing and venues associated with IEEE and SIAM.

Academic career and positions

Tarjan held positions at industrial and academic institutions, including a long tenure at Bell Labs and its successor AT&T Labs Research, and faculty appointments at Princeton University and visiting roles at Stanford University and Cornell University. He collaborated with faculty from Massachusetts Institute of Technology, Harvard University, and Yale University, and participated in programs at research centers like the Institute for Advanced Study, Mathematical Sciences Research Institute, and national labs affiliated with NSF and DARPA. Tarjan advised doctoral students who became faculty at places like UC Berkeley, Columbia University, University of Washington, and Carnegie Mellon University, connecting him to broader networks in theoretical computer science.

Major contributions and algorithms

Tarjan produced numerous seminal results in graph theory, data structures, and algorithm design. His work on depth-first search variants led to linear-time algorithms for finding strongly connected components and biconnected components, influencing research on planar graph testing and graph embedding. He co-developed the Tarjan–Shiloach algorithm family and introduced amortized analysis techniques used in work by Sleator and Tarjan on splay trees and amortized bounds for disjoint-set data structures, which impacted results in union-find operations and applications in minimum spanning tree algorithms such as Kruskal's algorithm and Prim's algorithm. Tarjan and collaborators devised efficient algorithms for maximum flow and minimum cut problems, relating to classical methods like the Edmonds–Karp algorithm and modern approaches tied to Gomory–Hu tree constructions.

His research on planar graphs and graph minors intersected with the work of Paul Erdős, László Lovász, and Neil Robertson, and contributed to algorithmic techniques used in graph drawing and network routing studies at companies like Google and Cisco Systems. Tarjan's development of low-high ordering, link-cut trees, and algorithms for dominator trees influenced compiler optimizations in compilers such as GCC and LLVM and connected to control-flow analysis in software tools from Microsoft Research and IBM Research.

Awards and honors

Tarjan has been recognized by many major organizations. He received the ACM Turing Award, the National Medal of Science, the Knuth Prize, and the Paris Kanellakis Theory and Practice Award; he is a member of the National Academy of Sciences and a fellow of the Association for Computing Machinery and the American Academy of Arts and Sciences. His honors include the IEEE John von Neumann Medal, election to the National Academy of Engineering, and prizes awarded by societies such as SIAM and IFIP. Tarjan has delivered keynote lectures at venues including the International Congress of Mathematicians, the ACM SIGPLAN Conference, and the Symposium on Theory of Computing (STOC).

Selected publications

- Tarjan, R. "Depth‑first search and linear graph algorithms." Proceedings of the SIAM Journal on Computing. - Tarjan, R., Sleator, D. "Self‑adjusting binary search trees." Journal of the ACM. - Tarjan, R. "Applications of amortized analysis to data structures." Communications of the ACM. - Tarjan, R., La Poutre, H. "Union‑find algorithms and their applications." Journal of Algorithms. - Tarjan, R., Valdes, J. "Efficient algorithms for planar graph problems." Proceedings of the ACM Symposium on Theory of Computing.

Category:Computer scientists