Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan joined Princeton University as the James S. McDonnell Distinguished University…
Works, Career, Technology & Science
Explore the main themes, entities and connections around Robert Tarjan. Start with the topic map, then use the sections below for research and deeper semantic analysis.
Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the full topic structure. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
See the strongest relationship patterns around the current topic before diving into the raw triples.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
tarjan robert data algorithms science computer structures mathematics princeton university award algorithm acm california graph 1985 institute stanford research 1972
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| Robert Tarjan | Awards | Paris Kanellakis Award (1999) Turing Award (1986) Nevanlinna Prize (1982) | 1.00 | infobox |
| Robert Tarjan | Born | Robert Endre Tarjan (1948-04-30) April 30, 1948 (age 78) Pomona, California, U.S. | 1.00 | infobox |
| Robert Tarjan | Doctoral advisor | Robert W. Floyd | 1.00 | infobox |
| Robert Tarjan | Doctoral students | Thomas Lengauer | 1.00 | infobox |
| Robert Tarjan | Doctoral students | Monika Henzinger | 1.00 | infobox |
| Robert Tarjan | Doctoral students | Ramesh Sitaraman | 1.00 | infobox |
| Robert Tarjan | Doctoral students | Daniel Sleator | 1.00 | infobox |
| Robert Tarjan | Doctoral students | Jeff Westbrook | 1.00 | infobox |
| Robert Tarjan | Education | California Institute of Technology (BS) Stanford University (MS, PhD) | 1.00 | infobox |
| Robert Tarjan | Fields | Computer science | 1.00 | infobox |
| Robert Tarjan | Known for | Algorithms and data structures | 1.00 | infobox |
| Robert Tarjan | Other academic advisors | Donald Knuth | 1.00 | infobox |
| Robert Tarjan | Thesis | An Efficient Planarity Algorithm (1972) | 1.00 | infobox |
| Robert Tarjan | Website | www.cs.princeton.edu/~ret/ | 1.00 | infobox |
| Robert Tarjan | Workplaces | Princeton University New York University Stanford University University of California, Berkeley Cornell University Microsoft Research Intertrust Technologies Hewlett-Packard Com… | 1.00 | infobox |
These clusters group vocabulary that occurs around closely connected concepts in the source material.
Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.