Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms...

strong component algorithm. The algorithm is named for its inventor, Robert Tarjan. The algorithm takes a directed graph as input, and produces a partition...

Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including: Tarjan's strongly connected components algorithm Tarjan's...

the greatest depth in T. It is named after Robert Tarjan, who discovered the technique in 1979. Tarjan's algorithm is an offline algorithm; that is,...

States. In 1999, he won the ACM Paris Kanellakis Award (jointly with Robert Tarjan) for the splay tree data structure. He was one of the pioneers in amortized...

to: Tarján, Hungary James Tarjan (1952), American chess grandmaster Robert Tarjan (1948), American computer scientist Tarcan (disambiguation) Tarkan (disambiguation)...

number of edges) for finding the bridges in a graph was described by Robert Tarjan in 1974. It performs the following steps: Find a spanning forest of...

logarithm of n {\displaystyle n} , by Hopcroft and Ullman. In 1975, Robert Tarjan was the first to prove the O ( m α ( n ) ) {\displaystyle O(m\alpha...

fit that pattern. The splay tree was invented by Daniel Sleator and Robert Tarjan in 1985. All normal operations on a binary search tree are combined...

components in a connected undirected graph is due to John Hopcroft and Robert Tarjan (1973). It runs in linear time, and is based on depth-first search....

their work on operating system theory, and for developing Unix. 1986: Robert Tarjan 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 Robert Tarjan in 1972, performs a single pass of depth-first...

undisclosed terms. In October 2014, Princeton University professor Robert Tarjan rejoined Intertrust as chief scientist. In December 2016, the company...

amortized analysis. The technique was first formally introduced by Robert Tarjan in his 1985 paper Amortized Computational Complexity, which addressed...

(Second ed.), MIT Press, pp. 498–524, ISBN 0-262-03293-7. Paige, Robert; Tarjan, Robert E. (1987), "Three partition refinement algorithms", SIAM Journal...

Robert W Floyd (June 8, 1936 – September 25, 2001) was a computer scientist. His contributions include the design of the Floyd–Warshall algorithm (independently...

and Robert E. Tarjan (2000), Simple Confluently Persistent Catenable Lists, SIAM Journal on Computing Vol. 30, Iss. 3 Radu Mihaescu and Robert Tarjan (Aug...

fastest minimum spanning tree algorithm to date, with Philip Klein and Robert Tarjan. They found a linear time randomized algorithm based on a combination...

original on October 27, 2021. Retrieved March 4, 2024. V. King. "Robert (Bob) Endre Tarjan - A.M. Turing Award Laureate". Association for Computing Machinery...

Alfred Aho, John Hopcroft, and Jeffrey Ullman (1973), but Dov Harel and Robert Tarjan (1984) were the first to develop an optimally efficient lowest common...

science are the development of the Fibonacci heap in a joint work with Robert Tarjan, the transdichotomous model of integer computing with Dan Willard, and...

amortized performance, introduced by Michael Fredman, Robert Sedgewick, Daniel Sleator, and Robert Tarjan in 1986. Pairing heaps are heap-ordered multiway...

distance problem admit polynomial time algorithms. Daniel Sleator, Robert Tarjan and William Thurston showed that the rotation distance between any two...

complex of sets of nonattacking rooks on a chessboard. John Hopcroft and Robert Tarjan derived a means of testing the planarity of a graph in time linear to...

Ph.D. Stanford 1966. Ronald Rivest: BA Yale 1969; PhD Stanford 1974. Robert Tarjan: BS Caltech 1969; MS Stanford 1971, PhD 1972. Non-alumni former and...

D.), computer scientist Alfred Spector (Ph.D.), computer scientist Robert Tarjan (Ph.D. 1972), Turing Award-winning computer scientist Frederick Terman...

in connection with the problem of rotation distance, Daniel Sleator, Robert Tarjan, and William Thurston provided a proof that the diameter of the n-dimensional...

be a winning strategy for the first player. In 1976, Shimon Even and Robert Tarjan proved that determining whether a position in a game of generalized...

Interval (graph theory) Static single assignment form Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph"...

Mellon University in 1996 under advisers Peter Lee, Robert Harper, Daniel Sleator, and Robert Tarjan. Prior to his current academic appointment, he taught...