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

Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph...

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

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

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...

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...

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...

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

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....

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

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...

(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 (born Robert Willoughby Floyd; June 8, 1936 – September 25, 2001) was an American computer scientist. His contributions include the design...

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

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

their work on operating system theory, and for developing Unix. 1986: Robert Tarjan with John Hopcroft, for fundamental achievements in the design and analysis...

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...

her PhD in 1993 from Princeton University under the supervision of Robert Tarjan. She then became an assistant professor of computer science at Cornell...

Year Laureate Reasons 1982 Robert Tarjan "Received the first Nevanlinna Prize for outstanding contributions to mathematical aspects of information science...

with Robert Tarjan) "for fundamental achievements in the design and analysis of algorithms and data structures." Along with his work with Tarjan on planar...

zip tree was introduced as a variant of random binary search tree by Robert Tarjan, Caleb Levy, and Stephen Timmel. Zip trees are similar to max treaps...

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...

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 Robert Tarjan in 1986. Pairing heaps are heap-ordered multiway...

isolated vertices. It was developed by David Karger, Philip Klein, and Robert Tarjan. The algorithm relies on techniques from Borůvka's algorithm along with...

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...

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