Robert Tarjan

Cited by

	All	Since 2018
Citations	93061	18519
h-index	119	66
i10-index	308	175

3700

1850

925

2775

1984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023426 579 614 717 1048 1147 1279 1419 1597 1603 1654 1812 1665 1802 1780 1655 1623 1592 1679 2000 2172 2751 2630 2962 2919 2897 3112 3057 3363 3644 3449 3440 3429 3270 3440 3122 3079 3098 2989 2784

Public access

View all

8 articles

1 article

available

not available

Based on funding mandates

Co-authors

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Verified email at alum.mit.edu
Bill HornePrincipal Product Manager, AWS CryptographyVerified email at amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaVerified email at cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentVerified email at research.att.com
Renato WerneckAmazonVerified email at cs.princeton.edu
James B. OrlinProfessor, Massachusetts Institute of TechnologyVerified email at mit.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityVerified email at cs.columbia.edu
Siddhartha SenMicrosoft Research (NYC)Verified email at microsoft.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Ronald L. RivestMIT Institute ProfessorVerified email at mit.edu

Robert Tarjan

Professor of Computer Science, Princeton University

Verified email at cs.princeton.edu

data structures graph algorithms analysis of algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	9188	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	4211	1987
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3292	1983
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3284	1988
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	3038	1985
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	1939	1985
Efficiency of a good but not linear set union algorithm RE Tarjan Journal of the ACM (JACM) 22 (2), 215-225, 1975	1890	1975
A separator theorem for planar graphs RJ Lipton, RE Tarjan SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979	1846	1979
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1775	1973
Algorithmic aspects of vertex elimination DJ Rose, RE Tarjan Proceedings of the seventh annual ACM Symposium on Theory of Computing, 245-254, 1975	1774	1975
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1745	1974
Three partition refinement algorithms R Paige, RE Tarjan SIAM Journal on computing 16 (6), 973-989, 1987	1674	1987
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1535	1981
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1513	1973
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	1482	1984
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1474	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	1278	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1159	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	1123	1986
Applications of a planar separator theorem RJ Lipton, RE Tarjan 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 162-170, 1977	1003	1977

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors