World Library  
Flag as Inappropriate
Email this Article

Robert Tarjan

Article Id: WHEBN0000046127
Reproduction Date:

Title: Robert Tarjan  
Author: World Heritage Encyclopedia
Language: English
Subject: List of Turing Award laureates by university affiliation, Nevanlinna Prize, Summer Science Program, Turing Award, Adi Shamir
Collection: 1948 Births, American Computer Scientists, California Institute of Technology Alumni, Fellows of the Association for Computing MacHinery, Fellows of the Society for Industrial and Applied Mathematics, Guggenheim Fellows, Living People, Members of the United States National Academy of Engineering, Members of the United States National Academy of Sciences, Nevanlinna Prize Laureates, People from Pomona, California, Princeton University Faculty, Scientists at Bell Labs, Stanford University Alumni, Summer Science Program, Theoretical Computer Scientists, Turing Award Laureates
Publisher: World Heritage Encyclopedia

Robert Tarjan

Robert Endre Tarjan
Born (1948-04-30) April 30, 1948
Pomona, California
Fields Computer Science
Institutions Cornell
Stanford University
New York University
Princeton University
Alma mater Caltech,
Thesis An Efficient Planarity Algorithm (1972)
Known for Algorithms and data structures
Notable awards Nevanlinna Prize (1982)
Turing Award (1986)
Paris Kanellakis Award (1999)

Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's off-line least common ancestors 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 the Chief Scientist at Intertrust Technologies.[1]


  • Early life and education 1
  • Computer science career 2
    • Algorithms and data structures 2.1
  • Awards 3
  • Patents 4
  • Notes 5
  • References 6
  • External links 7

Early life and education

He was born in Pomona, California. His father was a child psychiatrist specializing in mental retardation, and ran a state hospital.[2] As a child, Tarjan read a lot of science fiction, and wanted to be an astronomer. He became interested in mathematics after reading Martin Gardner's mathematical games column in Scientific American. He became seriously interested in math in the eighth grade, thanks to a "very stimulating" teacher.[3]

While he was in high school, Tarjan got a job, where he worked IBM card punch collators. He first worked with real computers while studying astronomy at the Summer Science Program in 1964.[2]

Tarjan obtained a Bachelor's degree in mathematics from the California Institute of Technology in 1969. At Stanford University, he received his Master's degree in computer science in 1971 and a Ph.D. in computer science (with a minor in mathematics) in 1972. At Stanford, he was supervised by Robert Floyd[4] and Donald Knuth,[5] both highly prominent computer scientists, and his Ph.D. dissertation was An Efficient Planarity Algorithm. Tarjan selected computer science as his area of interest because he believed that CS was a way of doing mathematics that could have a practical impact.[6]

Computer science career

Tarjan has been teaching at Princeton University since 1985.[6] He has also held academic positions at Cornell University (1972–73), University of California, Berkeley (1973–1975), Stanford University (1974–1980), and New York University (1981–1985). He has also been a fellow of the NEC Research Institute (1989–1997).[7] In April 2013 he joined Microsoft Research Silicon Valley in addition to the position at Princeton. In October 2014 he rejoined Intertrust Technologies as chief scientist.

Tarjan has worked at AT&T Bell Labs (1980–1989), Intertrust Technologies (1997–2001, 2014–present), Compaq (2002) and Hewlett Packard (2006–2013).

Algorithms and data structures

Tarjan is known for his pioneering work on graph theory algorithms and data structures. Some of his well-known algorithms include Tarjan's off-line least common ancestors algorithm, and Tarjan's strongly connected components algorithm, and he was one of five co-authors of the median of medians linear time selection algorithm. The Hopcroft-Tarjan planarity testing algorithm was the first linear-time algorithm for planarity-testing.[8]

Tarjan has also developed important data structures such as the Fibonacci heap (a heap data structure consisting of a forest of trees), and the splay tree (a self-adjusting binary search tree; co-invented by Tarjan and Daniel Sleator). Another significant contribution was the analysis of the disjoint-set data structure; he was the first to prove the optimal runtime involving the inverse Ackermann function.


Tarjan received the Turing Award jointly with John Hopcroft in 1986. The citation for the award states[7] that it was:

For fundamental achievements in the design and analysis of algorithms and data structures.

Tarjan was also elected an ACM Fellow in 1994. The citation for this award states:[9]

For seminal advances in the design and analysis of data structures and algorithms.

Some of the other awards for Tarjan include:


Tarjan holds at least 18 U.S. patents.[12] These include:

  • J. Bentley, D. Sleator, and R. E. Tarjan, U. S. Patent 4,796,003, Data Compaction, 1989[13]
  • N. Mishra, R. Schreiber, and R. E. Tarjan, U. S. Patent 7,818,272, Method for discovery of clusters of objects in an arbitrary undirected graph using a difference between a fraction of internal connections and maximum fraction of connections by an outside object, 2010[14]
  • B. Pinkas, S. Haber, R. E. Tarjan, and T. Sander, U. S. Patent 8220036, Establishing a secure channel with a human user, 2012[15]


  1. ^
  2. ^ a b Shasha, Dennis Elliott; Lazere, Cathy A. (1998) [1995]. "Robert E. Tarjan: In Search of Good Structure". Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists. Copernicus/Springer. pp. 102–119.  
  3. ^ "Robert Tarjan: The Art of the Algorithm". Hewlett-Packard. Retrieved 2010-09-05. 
  4. ^ "Robert Endre Tarjan". Mathematics Genealogy Project. Retrieved 2008-01-09. 
  5. ^ Robert, Tarjan. "Curriculum Vitae". 
  6. ^ a b "Robert Endre Tarjan: The art of the algorithm (interview)". Hewlett-Packard. September 2004. Retrieved 2008-01-09. 
  7. ^ a b c d e f Turing award citation, ACM, retrieved 2014-01-19.
  8. ^ Kocay, William; Kreher, Donald L (2005). "Planar Graphs". Graphs, algorithms, and optimization. Boca Raton: Chapman & Hall/CRC. p. 312.  
  9. ^
  10. ^ Nevanlinna prize winners, International Mathematical Union, retrieved 2014-01-19.
  11. ^
  12. ^
  13. ^,796,003.PN.&OS=PN/4,796,003&RS=PN/4,796,003
  14. ^,818,272.PN.&OS=PN/7,818,272&RS=PN/7,818,272
  15. ^


  • Tarjan, Robert E. (1983). Data structures and network algorithms. Philadelphia: Society for Industrial and Applied Mathematics.  
  • Tarjan, Robert E.; Pólya, George; Woods, Donald R (1983). Notes on introductory combinatorics. Boston: Birkhauser.  
  • OCLC entries for Robert E Tarjan
  • DBLP entry for Robert Endre Tarjan

External links

  • DBLP: Robert Endre Tarjan
  • List of Robert Tarjan's patents on IPEXL's Patent Directory
  • Robert Tarjan's home page at Princeton.
  • Mathematics Genealogy Project entry for Robert Endre Tarjan.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.