Robert Tarjan

Citace

	Všechny	Od 2018
Citace	93132	18581
h-index	119	66
i10-index	308	176

3700

1850

925

2775

1984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023426 580 614 717 1048 1147 1279 1420 1598 1603 1654 1812 1665 1802 1782 1655 1623 1592 1679 2002 2172 2750 2630 2962 2919 2897 3113 3058 3362 3643 3450 3440 3431 3271 3440 3126 3078 3090 2991 2849

Veřejný přístup

Zobrazit všechny

8 článků

1 článek

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.E-mailová adresa ověřena na: alum.mit.edu
Bill HornePrincipal Product Manager, AWS CryptographyE-mailová adresa ověřena na: amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaE-mailová adresa ověřena na: cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentE-mailová adresa ověřena na: research.att.com
Renato WerneckAmazonE-mailová adresa ověřena na: cs.princeton.edu
James B. OrlinProfessor, Massachusetts Institute of TechnologyE-mailová adresa ověřena na: mit.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityE-mailová adresa ověřena na: cs.columbia.edu
Siddhartha SenMicrosoft Research (NYC)E-mailová adresa ověřena na: microsoft.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusE-mailová adresa ověřena na: mpi-inf.mpg.de
Ronald L. RivestMIT Institute ProfessorE-mailová adresa ověřena na: mit.edu

Sledovat

Robert Tarjan

Professor of Computer Science, Princeton University

E-mailová adresa ověřena na: cs.princeton.edu

data structures graph algorithms analysis of algorithms


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	9194	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	4210	1987
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3293	1983
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3288	1988
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	3041	1985
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	1941	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
Algorithmic aspects of vertex elimination DJ Rose, RE Tarjan Proceedings of the seventh annual ACM Symposium on Theory of Computing, 245-254, 1975	1776	1975
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
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1748	1974
Three partition refinement algorithms R Paige, RE Tarjan SIAM Journal on computing 16 (6), 973-989, 1987	1677	1987
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1537	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	1475	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	1279	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1163	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	1004	1977

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři