Robert Tarjan: Search Tree Mysteries

Channel: princetonacademics   |   2012/08/24
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
tarjan
::2012/03/28::
Play Video
4
05. Tarján Pál - Let It Be
05. Tarján Pál - Let It Be
::2012/10/18::
Play Video
5
Tarjan ajatuksia kuntavaikuttamisesta
Tarjan ajatuksia kuntavaikuttamisesta
::2012/09/29::
Play Video
6
SCC-1
SCC-1
::2010/03/21::
Play Video
7
tarjan
tarjan
::2014/02/13::
Play Video
8
TT nyar tarjan dora
TT nyar tarjan dora
::2012/08/24::
Play Video
9
TARJAN.mp4
TARJAN.mp4
::2011/05/16::
Play Video
10
Tarjan
Tarjan
::2014/03/01::
Play Video
11
rishabh tarjan
rishabh tarjan
::2012/06/25::
Play Video
12
Houson and Zach Interview Tarjan
Houson and Zach Interview Tarjan
::2011/11/02::
Play Video
13
TARJAN
TARJAN
::2012/01/07::
Play Video
14
GRE Computer Science Question 41
GRE Computer Science Question 41
::2012/04/04::
Play Video
15
tarjan
tarjan
::2012/08/05::
Play Video
16
lecture 24 Search Trees   III
lecture 24 Search Trees III
::2014/03/13::
Play Video
17
Alan M. Turing Centennial Conference: Geometry in Motion: From Turing Machines to Crawling Ants
Alan M. Turing Centennial Conference: Geometry in Motion: From Turing Machines to Crawling Ants
::2012/04/25::
Play Video
18
Juan Tarjan - Me & the Devil Blues
Juan Tarjan - Me & the Devil Blues
::2011/06/17::
Play Video
19
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
20
Karesz tarján 7
Karesz tarján 7
::2008/05/07::
Play Video
21
800 MHz NMR Arrives in the Frick Chemistry Lab
800 MHz NMR Arrives in the Frick Chemistry Lab
::2013/06/20::
Play Video
22
Andromeda Hip-hop Táncstúdió 2009 Tarján
Andromeda Hip-hop Táncstúdió 2009 Tarján
::2009/07/09::
Play Video
23
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
24
Avi Wigderson: The hardness of proving computational hardness
Avi Wigderson: The hardness of proving computational hardness
::2012/08/24::
Play Video
25
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
26
Christos Papadimitriou: The Origin of Computable Numbers -- A Tale of Two Classics
Christos Papadimitriou: The Origin of Computable Numbers -- A Tale of Two Classics
::2012/08/24::
Play Video
27
karesz tarján 3
karesz tarján 3
::2007/11/27::
Play Video
28
Robert vs. Dead Tree
Robert vs. Dead Tree
::2010/11/15::
Play Video
29
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
30
Information, Data, Security in a Networked Future
Information, Data, Security in a Networked Future
::2013/01/23::
Play Video
31
Ronald Rivest: The Growth of Cryptography
Ronald Rivest: The Growth of Cryptography
::2012/08/24::
Play Video
32
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
33
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
34
Progress in Motion with Barefoot Ted
Progress in Motion with Barefoot Ted
::2013/03/15::
Play Video
35
Jim Bob Tree
Jim Bob Tree
::2012/12/05::
Play Video
36
"Peking," circa 1928
"Peking," circa 1928
::2010/06/18::
Play Video
37
Keller Center lecture: Bill Drayton
Keller Center lecture: Bill Drayton
::2010/01/07::
Play Video
38
Travel Book Review: Catamarans by Gregor Tarjan
Travel Book Review: Catamarans by Gregor Tarjan
::2012/10/24::
Play Video
39
Szeged - Tarján vihar után
Szeged - Tarján vihar után
::2010/06/18::
Play Video
40
A Moment with Mr Boran & Mrs Neslihan Tarjan at the North Cyprus Turkish Festival
A Moment with Mr Boran & Mrs Neslihan Tarjan at the North Cyprus Turkish Festival
::2009/12/25::
Play Video
41
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
42
You
You're a Mystery
::2012/03/08::
Play Video
43
The mystery of the tree gods p.3
The mystery of the tree gods p.3
::2012/04/19::
Play Video
44
OFFICIAL TRAILER DFS
OFFICIAL TRAILER DFS
::2012/08/13::
Play Video
45
The Search for the V-Tree (7/20/10-48)
The Search for the V-Tree (7/20/10-48)
::2010/07/26::
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
karesz tarján 1
karesz tarján 1
::2007/12/05::
Play Video
48
Intro :L
Intro :L
::2011/12/23::
Play Video
49
The Power of One
The Power of One
::2009/07/08::
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