Robert Tarjan

Citada per

	Totes	Des de 2020
Citacions	97180	15490
Índex h	122	62
Índex i10	316	168

3700

1850

925

2775

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025627 713 1054 1141 1340 1429 1603 1644 1671 1801 1693 1807 1782 1703 1624 1582 1710 2027 2155 2737 2669 2981 2913 2947 3128 3073 3393 3635 3441 3451 3424 3283 3500 3168 3087 3110 3037 2947 2901 407

Accés públic

Mostra-ho tot

14 articles

1 article

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Correu electrònic verificat a alum.mit.edu
Bill HorneSenior Manager, AWS CryptographyCorreu electrònic verificat a amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaCorreu electrònic verificat a cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentCorreu electrònic verificat a research.att.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyCorreu electrònic verificat a mit.edu
Renato WerneckAmazonCorreu electrònic verificat a cs.princeton.edu
Siddhartha SenMicrosoft Research (NYC)Correu electrònic verificat a microsoft.com
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityCorreu electrònic verificat a cs.columbia.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusCorreu electrònic verificat a mpi-inf.mpg.de
Ronald L. RivestMIT Institute ProfessorCorreu electrònic verificat a mit.edu

Segueix

Robert Tarjan

Professor of Computer Science, Princeton University

Correu electrònic verificat a cs.princeton.edu

data structures graph algorithms analysis of algorithms


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	9771	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	4379	1987
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3435	1988
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3372	1983
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	3148	1985
Efficiency of a good but not linear set union algorithm RE Tarjan Journal of the ACM (JACM) 22 (2), 215-225, 1975	1961	1975
A separator theorem for planar graphs RJ Lipton, RE Tarjan SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979	1939	1979
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	1880	1985
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1845	1973
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1820	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	1727	1987
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1634	1981
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1611	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	1523	1984
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1506	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	1331	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1191	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	1180	1986
Applications of a planar separator theorem RJ Lipton, RE Tarjan 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 162-170, 1977	1032	1977

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors