Robert Tarjan

From Wikipedia, the free encyclopedia

(Redirected from Tarjan)
Jump to: navigation, search
Robert Endre Tarjan
Born April 30, 1948 (1948-04-30) (age 59)
Pomona, California
Field Computer Science
Institutions Princeton University
Hewlett-Packard
Known for Tarjan's off-line least common ancestors algorithm
Notable prizes Turing Award

Robert Endre Tarjan (born April 30, 1948 in Pomona, California) is a renowned American computer scientist. He is the discoverer of several important graph algorithms, including Tarjan's off-line least common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps.

Tarjan received the Turing Award jointly with John Hopcroft in 1986. The citation for the award states 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 [1] states:

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

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 Donald Knuth, both highly prominent computer scientists.

Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, and also works for Hewlett-Packard.


Persondata
NAME Tarjan, Robert Endre
ALTERNATIVE NAMES
SHORT DESCRIPTION Computer scientist
DATE OF BIRTH April 30, 1948
PLACE OF BIRTH Pomona, California
DATE OF DEATH
PLACE OF DEATH
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.