Global Information Lookup Global Information

Robert Tarjan information


Robert Endre Tarjan
Born (1948-04-30) April 30, 1948 (age 76)
Pomona, California
CitizenshipAmerican
Alma materCalifornia Institute of Technology (BS)
Stanford University (MS, PhD)
Known forAlgorithms and data structures
AwardsParis Kanellakis Award (1999)
Turing Award (1986)
Nevanlinna Prize (1982)
Scientific career
FieldsComputer science
InstitutionsPrinceton University
New York University
Stanford University
University of California, Berkeley
Cornell University
Microsoft Research
Intertrust Technologies
Hewlett-Packard
Compaq
NEC Research
Bell Labs
ThesisAn Efficient Planarity Algorithm (1972)
Doctoral advisorRobert W. Floyd
Other academic advisorsDonald Knuth
Doctoral students
  • Thomas Lengauer
  • Monika Henzinger
  • Ramesh Sitaraman
  • Daniel Sleator
  • Jeff Westbrook
Websitewww.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.

and 21 Related for: Robert Tarjan information

Request time (Page generated in 0.811 seconds.)

Robert Tarjan

Last Update:

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

Word Count : 1467

Daniel Sleator

Last Update:

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

Word Count : 433

Splay tree

Last Update:

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

Word Count : 4628

Biconnected component

Last Update:

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

Word Count : 1363

Amortized analysis

Last Update:

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

Word Count : 1165

Bell Labs

Last Update:

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

Word Count : 12787

Strongly connected component

Last Update:

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

Word Count : 1639

Chris Okasaki

Last Update:

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

Word Count : 153

Intertrust Technologies Corporation

Last Update:

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

Word Count : 1511

Disjoint sets

Last Update:

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

Word Count : 1284

Turing Award

Last Update:

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

Word Count : 3519

Pairing heap

Last Update:

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

Word Count : 2045

Lowest common ancestor

Last Update:

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

Word Count : 2991

Tree rotation

Last Update:

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

Word Count : 1443

Topological graph theory

Last Update:

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

Word Count : 565

List of Stanford University alumni

Last Update:

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

Word Count : 23322

Stanford University

Last Update:

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

Word Count : 17240

Associahedron

Last Update:

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

Word Count : 1455

David Karger

Last Update:

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

Word Count : 559

John Hopcroft

Last Update:

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

Word Count : 776

Selection algorithm

Last Update:

medians method, published in 1973 by Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ron Rivest, and Robert Tarjan. They trace the formulation of the selection...

Word Count : 5704

PDF Search Engine © AllGlobal.net