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.
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.
RE Tarjan. Society for industrial and Applied Mathematics. , 1983. 3306. 1983. Amortized efficiency of list update and paging rules. DD Sleator, RE Tarjan.
1 de mai. de 2024 · Robert Endre Tarjan is a computer scientist and co-winner 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.”. Tarjan invented or co-invented some of the most efficient known algorithms.
- William L. Hosch
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.
Learn about the life and achievements of Robert E Tarjan, a pioneer in the design and analysis of algorithms and data structures. He collaborated with John Hopcroft on graph algorithms, developed the splay tree and the Fibonacci heap, and studied online algorithms and competitive analysis.
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.
