FACTOID # 29: 73.3% of America's gross operating surplus in motion picture and sound recording industries comes from California.
 
 Home   Encyclopedia   Statistics   States A-Z   Flags   Maps   FAQ   About 
   
 
WHAT'S NEW
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Robert Tarjan

Robert Endre Tarjan (born April 30, 1948 in Pomona, California) is a renowned computer scientist. He is the discoverer of several important graph algorithms, including Tarjan's off-line least common ancestors algorithm. April 30 is the 120th day of the year in the Gregorian calendar (121st in leap years), with 245 days remaining, as the last day in April. ... 1948 (MCMXLVIII) is a leap year starting on Thursday (link will take you to calendar). ... Pomona is a city located in Los Angeles County, California, in the eastern San Gabriel Valley. ... Computer science (informally: CS or compsci) is, in its most general sense, the study of computation and information processing, both in hardware and in software. ... In computer science, Tarjans off-line least common ancestors algorithm is an algorithm based on the least common ancestor property. ...


Tarjan received the Turing Award jointly with John Hopcroft in 1986. The citation for the award states that it was : The A.M. Turing Award is given annually by the Association for Computing Machinery to a person selected for contributions of a technical nature made to the computing community. ... John Hopcroft John E. Hopcroft (born October 7, 1939) is a renowned theoretical computer scientist and the grandson of Jacob Nist, founder of the Seattle Box Company. ...

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: The ACM Fellows Program was established by Council of the Association for Computing Machinery in 1993 to recognize and honor outstanding ACM members for their achievements in computer science and information technology and for their significant contributions to the mission of the ACM. There are presently about 500 Fellows out...

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. A bachelors degree is usually an undergraduate academic degree awarded for a course or major that generally lasts three or four years. ... The California Institute of Technology (commonly known as Caltech) is a private, coeducational university located in Pasadena, California, in the United States. ... 1969 (MCMLXIX) was a common year starting on Wednesday For other uses, see Number 1969. ... For other meanings of Stanford, see Stanford (disambiguation). ... A masters degree is an academic degree usually awarded for completion of a postgraduate or graduate course of one to three years in duration. ... 1971 (MCMLXXI) is a common year starting on Friday (click for link to calendar). ... Doctor of Philosophy (Ph. ... 1972 (MCMLXXII) was a leap year that started on a Saturday. ... Robert W Floyd (June 8, 1936 - September 25, 2001) was an eminent computer scientist. ... Donald Knuth at a reception for the Open Content Alliance. ...


Tarjan is currently a professor of Computer Science at Princeton University, and also works for Hewlett-Packard. Princeton University, located in Princeton, New Jersey, is the fourth-oldest institution of higher education in the United States. ... The Hewlett-Packard Company (NYSE: HPQ), commonly known as HP, is a very large, global company headquartered in Palo Alto, California, United States. ...


External links

  • Robert Tarjan's home page at Princeton

  Results from FactBites:
 
Linear Graph Algorithms Have Big Payoffs (2055 words)
Robert Frost and Robert Tarjan both advocate taking the road less traveled, although one is thinking of a yellow wood and the other of a graph, the mathematician's abstraction of a network.
Tarjan has explained that the biconnected component algorithm is one of several algorithms presented in the paper that illustrate how the theoretical properties of depth-first search can be used to devise efficient graph algorithms.
Tarjan's work is the starting point for an entire family of ideas that are part of the fabric of thought in diverse areas of science and engineering.
  More results at FactBites »

 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m