Play Video
1
Robert Tarjan: Search Tree Mysteries
Robert Tarjan: Search Tree Mysteries
::2012/08/24::
Play Video
2
An Algorithmic View of the Universe
An Algorithmic View of the Universe
::2013/01/23::
Play Video
3
TARJAN.mp4
TARJAN.mp4
::2011/05/16::
Play Video
4
¡PERDÓN  TARJÁN!
¡PERDÓN TARJÁN!
::2012/01/25::
Play Video
5
tarjan
tarjan
::2012/03/28::
Play Video
6
Tarjan ajatuksia kuntavaikuttamisesta
Tarjan ajatuksia kuntavaikuttamisesta
::2012/09/29::
Play Video
7
SCC-1
SCC-1
::2010/03/21::
Play Video
8
Robert Kahn: A Systems Approach to Managing Distributed Information
Robert Kahn: A Systems Approach to Managing Distributed Information
::2012/08/24::
Play Video
9
05. Tarján Pál - Let It Be
05. Tarján Pál - Let It Be
::2012/10/18::
Play Video
10
tarjan
tarjan
::2014/02/13::
Play Video
11
TT nyar tarjan dora
TT nyar tarjan dora
::2012/08/24::
Play Video
12
Tarjan
Tarjan
::2014/03/01::
Play Video
13
rishabh tarjan
rishabh tarjan
::2012/06/25::
Play Video
14
Houson and Zach Interview Tarjan
Houson and Zach Interview Tarjan
::2011/11/02::
Play Video
15
GRE Computer Science Question 41
GRE Computer Science Question 41
::2012/04/04::
Play Video
16
TARJAN
TARJAN
::2012/01/07::
Play Video
17
tarjan
tarjan
::2012/08/05::
Play Video
18
lecture 24 Search Trees   III
lecture 24 Search Trees III
::2014/03/13::
Play Video
19
Ronald Rivest: The Growth of Cryptography
Ronald Rivest: The Growth of Cryptography
::2012/08/24::
Play Video
20
Szent György Napok 2009 - Dancs Annamari és Tarján Pál
Szent György Napok 2009 - Dancs Annamari és Tarján Pál
::2009/04/28::
Play Video
21
Tarján 3 Iskola TV - Zenei Világnap Különkiadás
Tarján 3 Iskola TV - Zenei Világnap Különkiadás
::2009/10/28::
Play Video
22
Juan Tarjan - Me & the Devil Blues
Juan Tarjan - Me & the Devil Blues
::2011/06/17::
Play Video
23
Andromeda Hip-hop Táncstúdió 2009 Tarján
Andromeda Hip-hop Táncstúdió 2009 Tarján
::2009/07/09::
Play Video
24
Együtt töltött idők (2001-2009) 8.b Tarján 3
Együtt töltött idők (2001-2009) 8.b Tarján 3
::2009/06/13::
Play Video
25
Avi Wigderson: The hardness of proving computational hardness
Avi Wigderson: The hardness of proving computational hardness
::2012/08/24::
Play Video
26
9th Session of Turing100 | Evolution of the modern graphics architecture with a focus on GPUs
9th Session of Turing100 | Evolution of the modern graphics architecture with a focus on GPUs
::2013/05/17::
Play Video
27
The ACM A.M. Turing Award
The ACM A.M. Turing Award
::2013/01/16::
Play Video
28
Shafi Goldwasser: Pseudo Deterministic Algorithms
Shafi Goldwasser: Pseudo Deterministic Algorithms
::2012/08/24::
Play Video
29
Tarján 3 Iskola TV - Kézmosás Világnapja Különkiadás
Tarján 3 Iskola TV - Kézmosás Világnapja Különkiadás
::2009/11/16::
Play Video
30
2013. 08. 16. I. Mazsorett Találkozó Tarján - Héregi Gerecse Mazsorett Csoport
2013. 08. 16. I. Mazsorett Találkozó Tarján - Héregi Gerecse Mazsorett Csoport
::2013/08/19::
Play Video
31
Information, Data, Security in a Networked Future
Information, Data, Security in a Networked Future
::2013/01/23::
Play Video
32
Lecture 4: CSPs
Lecture 4: CSPs
::2013/02/01::
Play Video
33
Szeged Tarján:A hely
Szeged Tarján:A hely
::2008/10/11::
Play Video
34
Computable Real Numbers and Why They Are Still Important Today
Computable Real Numbers and Why They Are Still Important Today
::2013/01/23::
Play Video
35
karesz tarján 3
karesz tarján 3
::2007/11/27::
Play Video
36
Szeged - Tarján vihar után
Szeged - Tarján vihar után
::2010/06/18::
Play Video
37
Jim Bob Tree
Jim Bob Tree
::2012/12/05::
Play Video
38
2010.08.20 - Zenei Fesztivál Tarján (Mondschein Kapelle)
2010.08.20 - Zenei Fesztivál Tarján (Mondschein Kapelle)
::2010/08/23::
Play Video
39
Karesz tarján 7
Karesz tarján 7
::2008/05/07::
Play Video
40
Travel Book Review: Catamarans by Gregor Tarjan
Travel Book Review: Catamarans by Gregor Tarjan
::2012/10/24::
Play Video
41
PANEL DISCUSSION: New Policy Directions and Implications
PANEL DISCUSSION: New Policy Directions and Implications
::2014/04/11::
Play Video
42
Antal Árpád kampányban: Operett Dancs Annamari és Tarján Pál
Antal Árpád kampányban: Operett Dancs Annamari és Tarján Pál
::2008/05/26::
Play Video
43
karesz tarján 1
karesz tarján 1
::2007/12/05::
Play Video
44
You
You're a Mystery
::2012/03/08::
Play Video
45
Scott on what he liked best in college
Scott on what he liked best in college
::2014/04/11::
Play Video
46
Within Temptation - Paradise (What About Us?) ft. Tarja
Within Temptation - Paradise (What About Us?) ft. Tarja
::2013/09/26::
Play Video
47
Intro :L
Intro :L
::2011/12/23::
Play Video
48
How To Come Up With A Great Business Idea
How To Come Up With A Great Business Idea
::2014/01/27::
Play Video
49
Fractal Tree flat
Fractal Tree flat
::2009/05/12::
Play Video
50
Iskolai praktikák - diákoknak
Iskolai praktikák - diákoknak
::2012/02/21::
NEXT >>
RESULTS [51 .. 101]
From Wikipedia, the free encyclopedia
Jump to: navigation, search
Robert Endre Tarjan
Bob Tarjan.jpg
Born (1948-04-30) April 30, 1948 (age 65)
Pomona, California
Fields Computer Science
Institutions Cornell
Berkeley
Stanford University
New York University
Princeton University
Hewlett-Packard
Alma mater Caltech,
Stanford
Thesis An Efficient Planarity Algorithm (1972)
Known for Algorithms and data structures
Notable awards Turing Award
Nevanlinna Prize

Robert Endre Tarjan (born April 30, 1948) is an American computer scientist. 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 is also a Senior Fellow at Hewlett-Packard.[1]

Early life and education[edit]

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[edit]

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.

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

Algorithms and data structures[edit]

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.

Awards[edit]

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:

Notes[edit]

  1. ^ "HP Fellows: Robert Endre Tarjan". Hewlett-Packard. Retrieved 2008-01-09. 
  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. ISBN 978-0-387-97992-2. OCLC 32240355. 
  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. ISBN 978-1-58488-396-8. OCLC 56319851. 
  9. ^ http://www.acm.org/awards/fellows_citations_n-z/tarjan.html
  10. ^ Nevanlinna prize winners, International Mathematical Union, retrieved 2014-01-19.
  11. ^ http://media.caltech.edu/press_releases/13332

References[edit]

External links[edit]

Wikipedia content is licensed under the GFDL License

Mashpedia enables any individual or company to promote their own Youtube-hosted videos or Youtube Channels, offering a simple and effective plan to get them in front of our engaged audience.

Want to learn more? Please contact us at: hello@mashpedia.com

Powered by YouTube
LEGAL
  • Mashpedia © 2014