Resultado da Busca
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
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.
Robert Endre Tarjan ( Pomona, 30 de abril de 1948) é um informático estadunidense . Foi condecorado com o Prêmio Turing de 1986, juntamente com John Hopcroft, pelo projeto e análise de algorítmos e estruturas de dados. É professor da Universidade de Princeton e trabalha na Hewlett-Packard.
- Estados Unidos
- Princeton
Robert Tarjan is a distinguished professor of computer science at Princeton University, known for his work on data structures, graph algorithms, and computational complexity. He has received many awards and honors, including the ACM Turing Award, the Rolf Nevanlinna Prize, and the Blaise Pascal Medal.
Professor of Computer Science, Princeton University - Cited by 995 - Theory - Algorithms - Data Structures
Robert E. Tarjan is a distinguished professor of computer science at Princeton University. He is known for his research on algorithms, data structures, and graph theory.
With John E Hopcroft, for fundamental achievements in the design and analysis of algorithms and data structures. 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.
