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
Depth-first search and linear graph algorithms. R Tarjan. SIAM journal on computing 1 (2), 146-160. , 1972. 9373. 1972. Fibonacci heaps and their uses in improved network optimization algorithms. ML Fredman, RE Tarjan. Journal of the ACM (JACM) 34 (3), 596-615.
Robert Tarjan is a James S. McDonnell Distinguished University Professor of Computer Science and a leading expert in data structures, graph algorithms, combinatorial optimization, and parallel algorithms. He has won many awards and honors, including the ACM Turing Award, the Rolf Nevanlinna Prize, and the Blaise Pascal Medal.
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
Professor of Computer Science, Princeton University - Cited by 995 - Theory - Algorithms - Data Structures
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.
Robert Tarjan is a computer science professor at Stanford University and a leading expert in algorithms and data structures. He and John E. Hopcroft won the A.M. Turing Award in 1986 for their fundamental achievements in the design and analysis of algorithms and data structures for graph problems, such as planarity, strongly connected components, and union-find. Learn more about their research, citation, and video interview.
