Yahoo Italia Ricerca nel Web

Risultati di ricerca

  1. 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.

    • Algorithms and data structures
  2. Robert Endre Tarjan (Pomona, 30 aprile 1948) è un informatico statunitense, che ha scoperto ed analizzato molti importanti algoritmi riguardanti i grafi; in particolare a lui si deve quello noto come l'algoritmo di Tarjan del più basso antenato comune offline.

  3. Year. Depth-first search and linear graph algorithms. R Tarjan. SIAM journal on computing 1 (2), 146-160. , 1972. 9392. 1972. Fibonacci heaps and their uses in improved network optimization algorithms. ML Fredman, RE Tarjan.

  4. 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 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. Primary professional activities. Department of Computer Science, Princeton University.

  6. ‪Professor of Computer Science, Princeton University‬ - ‪‪Cited by 995‬‬ - ‪Theory‬ - ‪Algorithms‬ - ‪Data Structures‬

  7. ACM Turing Award. Lecture. Research. Subjects. Additional. Materials. Video Interview. 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.