Robert Tarjan

Navedeno

	Vse	Od leta 2020
Navedbe	97251	15532
indeks h	121	62
indeks i10	317	168

3700

1850

925

2775

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025621 712 1049 1171 1355 1471 1641 1640 1663 1781 1705 1785 1766 1664 1631 1577 1703 2023 2169 2777 2682 2980 2955 2904 3135 3089 3413 3635 3417 3461 3380 3275 3511 3159 3072 3075 2992 2930 2890 571

Javni dostop

Prikaži vse

13 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Preverjeni e-poštni naslov na alum.mit.edu
Bill HorneSenior Manager, AWS CryptographyPreverjeni e-poštni naslov na amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaPreverjeni e-poštni naslov na cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentPreverjeni e-poštni naslov na research.att.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Renato WerneckAmazonPreverjeni e-poštni naslov na cs.princeton.edu
Siddhartha SenMicrosoft Research (NYC)Preverjeni e-poštni naslov na microsoft.com
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityPreverjeni e-poštni naslov na cs.columbia.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusPreverjeni e-poštni naslov na mpi-inf.mpg.de
Ronald L. RivestMIT Institute ProfessorPreverjeni e-poštni naslov na mit.edu

Spremljaj

Robert Tarjan

Professor of Computer Science, Princeton University

Preverjeni e-poštni naslov na cs.princeton.edu

data structures graph algorithms analysis of algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	9786	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	4366	1987
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3428	1988
Data structures and network algorithms RE Tarjan Society for industrial and Applied Mathematics, 1983	3367	1983
Amortized efficiency of list update and paging rules DD Sleator, RE Tarjan Communications of the ACM 28 (2), 202-208, 1985	3130	1985
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	2005	1985
Efficiency of a good but not linear set union algorithm RE Tarjan Journal of the ACM (JACM) 22 (2), 215-225, 1975	1978	1975
A separator theorem for planar graphs RJ Lipton, RE Tarjan SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979	1937	1979
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1850	1973
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1813	1974
Algorithmic aspects of vertex elimination on graphs DJ Rose, RE Tarjan, GS Lueker SIAM Journal on computing 5 (2), 266-283, 1976	1754	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	1625	1981
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1602	1973
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1527	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	1339	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	1175	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji