Robert Tarjan

Получаване на мой собствен потребителски профил

Позовавания

	Всички	От 2020
Позовавания	97198	15497
h-индекс	121	62
i10-индекс	317	168

3700

1850

925

2775

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025621 712 1049 1171 1355 1471 1641 1639 1663 1781 1705 1785 1762 1666 1631 1577 1702 2023 2167 2780 2681 2986 2951 2903 3133 3085 3415 3635 3416 3461 3381 3273 3512 3160 3071 3076 2993 2928 2895 532

Публичен достъп

Преглед на всички

13 статии

1 статия

налични

неналични

Въз основа на изисквания при финансирането

Съавтори

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Потвърден имейл адрес: alum.mit.edu
Bill HorneSenior Manager, AWS CryptographyПотвърден имейл адрес: amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaПотвърден имейл адрес: cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentПотвърден имейл адрес: research.att.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyПотвърден имейл адрес: mit.edu
Renato WerneckAmazonПотвърден имейл адрес: cs.princeton.edu
Siddhartha SenMicrosoft Research (NYC)Потвърден имейл адрес: microsoft.com
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityПотвърден имейл адрес: cs.columbia.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusПотвърден имейл адрес: mpi-inf.mpg.de
Ronald L. RivestMIT Institute ProfessorПотвърден имейл адрес: mit.edu

Следене

Robert Tarjan

Professor of Computer Science, Princeton University

Потвърден имейл адрес: cs.princeton.edu

data structures graph algorithms analysis of algorithms


Заглавие Сортиране по цитати Сортиране по година Сортиране по заглавие	Позовавания Позовавания	Година
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	9775	1972
Fibonacci heaps and their uses in improved network optimization algorithms ML Fredman, RE Tarjan Journal of the ACM (JACM) 34 (3), 596-615, 1987	4363	1987
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3426	1988
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3364	1983
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	3129	1985
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	2004	1985
Efficiency of a good but not linear set union algorithm RE Tarjan Journal of the ACM (JACM) 22 (2), 215-225, 1975	1976	1975
A separator theorem for planar graphs RJ Lipton, RE Tarjan SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979	1935	1979
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1847	1973
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1812	1974
Algorithmic aspects of vertex elimination on graphs DJ Rose, RE Tarjan, GS Lueker SIAM Journal on computing 5 (2), 266-283, 1976	1753	1976
Three partition refinement algorithms R Paige, RE Tarjan SIAM Journal on computing 16 (6), 973-989, 1987	1739	1987
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1624	1981
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1601	1973
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1526	1984
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs RE Tarjan, M Yannakakis SIAM Journal on computing 13 (3), 566-579, 1984	1512	1984
A linear-time algorithm for testing the truth of certain quantified boolean formulas B Aspvall, MF Plass, RE Tarjan Information processing letters 8 (3), 121-123, 1979	1338	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1199	1973
Making data structures persistent JR Driscoll, N Sarnak, DD Sleator, RE Tarjan Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986	1176	1986
Applications of a planar separator theorem RJ Lipton, RE Tarjan 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 162-170, 1977	1047	1977

Системата не може да изпълни операцията сега. Опитайте отново по-късно.

Статии 1–20

Позовавания годишно

Дублирани описания

Обединени библиографски описания

Добавяне на съавториСъавтори

Следене

Позовавания

Съавтори