Resultado de búsqueda
Robert Endre Tarjan (Pomona, California; 30 de abril de 1948) es un científico de la computación estadounidense. Biografía [ editar ] Es el descubridor de numerosos importantes algoritmos de grafos , incluyendo el Algoritmo de Tarjan del mínimo número de ancestros ( Tarjan's off-line least common ancestors algorithm ), o los splay trees ...
- Robert Endre Tarjan
- Princeton
- Research
- Short Bio
- Selected Publications
Interests: Data structures; graph algorithms; combinatorial optimization; computational complexity; computational geometry; parallel algorithms ACM Turing Award, 1986; Fellow, American Academy of Arts & Sciences, 1985; Member, National Academy of Sciences, 1987; Member National Academy of Engineering, 1988; Member American Philosophical Society, 19...
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. His academic experience involved assistant professorships at Co...
“Data Structures and Network Algorithms.” R. E. Tarjan. CBMS 44, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983. (Book)“Notes on Introductory Combinatorics.” G. Polya, R. E. Tarjan, D. R. Woods. Birkhäuser, Boston, MA, 1983. (Book)“Depth-first search and linear graph algorithms.” R. E. Tarjan. SIAM Journal on Computing 1 (1972), pp. 146-160; preliminary version in Conf. Record Twelfth Annual Symp. on Switching and Automata T...“Fibonacci heaps and their uses in improved network optimization algorithms,” M. L. Fredman and R. E. Tarjan. J. Assoc. Comput. Mach. 34 (1987), pp. 596-615; preliminary version in Proc. 25th Annu...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
www .cs .princeton .edu /~ret /. 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.
Professor of Computer Science, Princeton University - Cited by 995 - Theory - Algorithms - Data Structures
Robert TARJAN | Cited by 67,826 | of Princeton University, New Jersey (PU) | Read 437 publications | Contact Robert TARJAN
