California Institute of Technology (BS) Stanford University (MS, PhD)
Known for
Algorithms and data structures
Awards
Paris Kanellakis Award (1999) Turing Award (1986) Nevanlinna Prize (1982)
Scientific career
Fields
Computer science
Institutions
Princeton University New York University Stanford University University of California, Berkeley Cornell University Microsoft Research Intertrust Technologies Hewlett-Packard Compaq NEC Research Bell Labs
Thesis
An Efficient Planarity Algorithm(1972)
Doctoral advisor
Robert W. Floyd
Other academic advisors
Donald Knuth
Doctoral students
Thomas Lengauer
Monika Henzinger
Ramesh Sitaraman
Daniel Sleator
Jeff Westbrook
Website
www.cs.princeton.edu/~ret/
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. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms...
States. In 1999, he won the ACM Paris Kanellakis Award (jointly with RobertTarjan) for the splay tree data structure. He was one of the pioneers in amortized...
fit that pattern. The splay tree was invented by Daniel Sleator and RobertTarjan in 1985. All normal operations on a binary search tree are combined...
components in a connected undirected graph is due to John Hopcroft and RobertTarjan (1973). It runs in linear time, and is based on depth-first search....
amortized analysis. The technique was first formally introduced by RobertTarjan in his 1985 paper Amortized Computational Complexity, which addressed...
their work on operating system theory, and for developing Unix. 1986: RobertTarjan with John Hopcroft, for fundamental achievements in the design and analysis...
Micha Sharir later published it in 1981. Tarjan's strongly connected components algorithm, published by RobertTarjan in 1972, performs a single pass of depth-first...
Mellon University in 1996 under advisers Peter Lee, Robert Harper, Daniel Sleator, and RobertTarjan. Prior to his current academic appointment, he taught...
undisclosed terms. In October 2014, Princeton University professor RobertTarjan rejoined Intertrust as chief scientist. In December 2016, the company...
(Second ed.), MIT Press, pp. 498–524, ISBN 0-262-03293-7. Paige, Robert; Tarjan, Robert E. (1987), "Three partition refinement algorithms", SIAM Journal...
original on October 27, 2021. Retrieved March 4, 2024. V. King. "Robert (Bob) Endre Tarjan - A.M. Turing Award Laureate". Association for Computing Machinery...
amortized performance, introduced by Michael Fredman, Robert Sedgewick, Daniel Sleator, and RobertTarjan in 1986. Pairing heaps are heap-ordered multiway...
Alfred Aho, John Hopcroft, and Jeffrey Ullman (1973), but Dov Harel and RobertTarjan (1984) were the first to develop an optimally efficient lowest common...
distance problem admit polynomial time algorithms. Daniel Sleator, RobertTarjan and William Thurston showed that the rotation distance between any two...
complex of sets of nonattacking rooks on a chessboard. John Hopcroft and RobertTarjan derived a means of testing the planarity of a graph in time linear to...
in connection with the problem of rotation distance, Daniel Sleator, RobertTarjan, and William Thurston provided a proof that the diameter of the n-dimensional...
fastest minimum spanning tree algorithm to date, with Philip Klein and RobertTarjan. They found a linear time randomized algorithm based on a combination...
with RobertTarjan) "for fundamental achievements in the design and analysis of algorithms and data structures." Along with his work with Tarjan on planar...
medians method, published in 1973 by Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ron Rivest, and RobertTarjan. They trace the formulation of the selection...