AOL Web Search

  1. About 3,640,000 search results
  1. 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 strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps.

    Robert Tarjan - Wikipedia

    https://en.wikipedia.org/wiki/Robert_Tarjan
  2. Web results:
  3. Robert Tarjan - Wikipedia

    en.wikipedia.org/wiki/Robert_Tarjan

    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 strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps.

  4. Robert Tarjan | Computer Science Department at Princeton ...

    www.cs.princeton.edu/people/profile/ret

    Robert E. Tarjan, the James S. McDonnell Distinguished University Professor of Computer Science, joined Princeton in 1985. He received doctoral and master’s degrees in computer science from Stanford in 1972 and 1971, respectively, after earning a bachelor’s in mathematics from Caltech.

  5. ‪Robert Tarjan‬ - ‪Google Scholar‬

    scholar.google.com/citations?user=lazJixIAAAAJ

    i10-index. 311. 175. Robert Tarjan. Professor of Computer Science, Princeton University. Verified email at cs.princeton.edu. data structures graph algorithms analysis of algorithms.

  6. Robert Endre Tarjan | American computer scientist | Britannica

    www.britannica.com/biography/Robert-Endre-Tarjan

    Robert Endre Tarjan, (born April 30, 1948, Pomona, California, U.S.), computer scientist and cowinner of the 1986 A.M. Turing Award, the highest honour in computer science, for “fundamental achievements in the design and analysis of algorithms and data structures.”

    • Robert E Tarjan, 1986 ACM Turing Award Recipient
      YouTube
    • Robert Tarjan: Search Tree Mysteries
      YouTube
    • 4th HLF – Lecture: Robert Tarjan
      YouTube
    • HLFF Shortcuts: Robert Tarjan
      YouTube
  7. Robert Tarjan - Princeton Engineering

    engineering.princeton.edu/faculty/robert-tarjan

    Robert Tarjan James S. McDonnell Distinguished University Professor of Computer Science. Website: http://www.cs.princeton.edu/~ret/ Email: ret@cs.Princeton.EDU Office ...

  8. Robert E. Tarjan - Robert Tarjan

    www.cs.princeton.edu/~ret

    Robert E. Tarjan Department of Computer Science Princeton University 35 Olden Street, Room 324 Princeton, NJ 08544-2087 Phone: (609) 270-1355 FAX: (609) 258-1771 ret@cs.princeton.edu Primary professional activities Department of Computer Science, Princeton University James S. McDonnell Distinguished University Professor of Computer Science.

  9. Robert Tarjan - live-simons-institute.pantheon.berkeley.edu

    live-simons-institute.pantheon.berkeley.edu/...

    Robert E. Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University and the Chief Scientist of Intertrust Technologies. Previously, he held academic positions at NYU, Stanford, UC Berkeley, and Cornell, and industrial research positions at Microsoft, HP, NEC, and Bell Labs.

  10. Robert E Tarjan - A.M. Turing Award Laureate

    amturing.acm.org/award_winners/tarjan_1092048

    Bob Tarjan was born on April 30, 1948 in Pomona, California. He received a B.S. in mathematics from Caltech in 1969, and was determined to do a Ph.D. but was undecided between mathematics and computer science. He finally chose computer science as a way to use his mathematical skills to solve problems of more practical interest.

  11. Robert Tarjan | Math - Princeton University

    www.math.princeton.edu/people/robert-tarjan

    Robert Tarjan Computer Science James. S. McDonnell Distinguished University Professor Computer Science Building 324 8-4797 ret@cs.princeton.edu

  12. Tarjan's strongly connected components algorithm - Wikipedia

    en.wikipedia.org/wiki/Tarjan's_strongly_connected...

    Tarjan's strongly connected components algorithmis an algorithmin graph theoryfor finding the strongly connected components(SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithmand the path-based strong component algorithm.