Robert Tarjan: Search Tree Mysteries
DIKU Talk: 'Simple Algorithms Whose Analysis Isn't' by Robert Tarjan
An Algorithmic View of the Universe
Interview with Robert Tarjan at DIKU
CACM August 2014 Feature Video Efficient Maximum Flow Algorithms
Seaholm High School's Tarzan, Saturday March 8th, 2014
Trailer - Tarzan and the Mermaids (1948)
"Tarzan - Two Worlds" Dance Break 2005
OSCON 2014: Include Hack - HHVM - PHP++; Paul Tarjan, Sara Golemon
Szeged Tarján város 1973-74
COVERSHOW -The Fashion Musical, Belvarosi theatre, 2006
HALLOWEEN MUSICAL MADNESS - The musical revue (Incl. The Rocky Horror Show), 2008
Trailer: Tarzan 3D (2013) HD
Hegyek KirályaTarján, 2013
Hegyek Királya futóverseny
Trailer - Tarzan the Ape Man (1981)
7.8 - Path Compression Tarjan's Analysis 1 - Advanced Union-Find - [DSA 2] By Tim Roughgarden
10.7 - Computing Strong Components: Algorithm - Graph Search - [DSA 1] By Tim Roughgarden
Tarján: meg kell mutatnunk, hogy civilek nélkül nincs demokrácia
Juan Tarjan - Me & the Devil Blues
Raid Sarja: Tarjan ja Raidin keskustelu
Dancs Annamari és Tarján Pál - Egy a szívem . egy a párom operett lemez egyveleg
Tarzan Official Trailer #1 (2013) - Motion Capture Movie HD
Szent György Napok 2009 - Dancs Annamari és Tarján Pál
Ricardo Mollo, Hugo Mendez y Juan Tarjan - Hoochie Coochie Man
Antal Árpád kampányban: Operett Dancs Annamari és Tarján Pál
Dancs Annamari es Tarjan Pal Keposszeallitas
Ungarndeutsche Tanzgruppe aus Tarian/Tarjan 2013 06 26
TT nyar tarjan dora
Houson and Zach Interview Tarjan
Tarzan of the Apes First ever film 1918 Gordon Griffith
Juan Tarjan, Alambre Gonzalez, Poncharelo y Cachin - Love Struck Baby
DUMA: AZ ÉHEZŐK VIADALA - A KIVÁLASZTOTT - PART I. - Fecsegőpicsogó
Within Temptation - Paradise (What About Us?) ft. Tarja
Robert Sedgewick: Big O notation is harmful!
Tarjan Birahang Rai
Greystoke The Legend of Tarzan, Lord of the Apes HOT SCENE
C felnőtt Jive S.tarján 2013
Serj Tankian - Sky Is Over (OFFICIAL VIDEO)
SCC - Strong Connected Components
Andromeda Hip-hop Táncstúdió 2009 Tarján
História do Tarzan.wmv
Dj Robert Georgescu feat Annamari Dancs-Live your life
The Faculty (3/11) Movie CLIP - Hostile Takeover (1998) HD
Iskolai praktikák - diákoknak
Finn WC-papír - Szertár (fizika)
From Wikipedia, the free encyclopedia
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 [ edit ]
He was born in
Pomona, California. His father was a child psychiatrist specializing in mental retardation, and ran a state hospital. As a child, Tarjan read a lot of science fiction, and wanted to be an [2 ] 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 and [4 ] Donald Knuth, both highly prominent computer scientists, and his Ph.D. dissertation was [5 ] 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.
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). [6 ] 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. [7 ]
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 [ 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.
Tarjan received the
Turing Award jointly with John Hopcroft in 1986. The citation for the award states that it was: [7 ]
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:
Patents [ edit ]
Tarjan holds at least 18 U.S. patents.
These include: [12 ]
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 ]
^ a b Shasha, Dennis Elliott; Lazere, Cathy A. (1998) . "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.
^ "Robert Tarjan: The Art of the Algorithm". Hewlett-Packard . Retrieved . 2010-09-05
^ "Robert Endre Tarjan". Mathematics Genealogy Project . Retrieved . 2008-01-09
^ Robert, Tarjan. "Curriculum Vitae".
^ a b "Robert Endre Tarjan: The art of the algorithm (interview)". Hewlett-Packard. September 2004 . Retrieved . 2008-01-09
^ a b c d e f Turing award citation, ACM, retrieved 2014-01-19.
^ 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.
^ Nevanlinna prize winners, International Mathematical Union, retrieved 2014-01-19.
References [ edit ]
External links [ edit ]
Adleman, Diffie, Hellman, Merkle, Rivest, Shamir (1996)
Lempel, Ziv (1997)
Bryant, Clarke, Emerson, McMillan (1998)
Sleator, Tarjan (1999)
Miller, Rabin, Solovay, Strassen (2003)
Freund, Schapire (2004)
Holzmann, Kurshan, Vardi, Wolper (2005)
Cortes, Vapnik (2008)
Bellare, Rogaway (2009)
Broder, Charikar, Indyk (2012)
Blumofe, Leiserson (2013)