Robert Tarjan

Dikutip oleh

	Semua	Sejak 2020
Kutipan	97331	15585
indeks-h	121	62
indeks-i10	317	169

3700

1850

925

2775

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025621 712 1049 1171 1355 1471 1642 1640 1663 1780 1705 1785 1766 1662 1630 1579 1704 2028 2169 2777 2683 2981 2961 2906 3134 3090 3416 3638 3416 3462 3386 3275 3510 3157 3072 3076 2994 2926 2907 608

Akses publik

Lihat semua

13 artikel

1 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Email yang diverifikasi di alum.mit.edu
Bill HorneSenior Manager, AWS CryptographyEmail yang diverifikasi di amazon.com
Loukas GeorgiadisDepartment of Computer Science & Engineering, University of IoanninaEmail yang diverifikasi di cs.uoi.gr
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentEmail yang diverifikasi di research.att.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyEmail yang diverifikasi di mit.edu
Renato WerneckAmazonEmail yang diverifikasi di cs.princeton.edu
Siddhartha SenMicrosoft Research (NYC)Email yang diverifikasi di microsoft.com
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityEmail yang diverifikasi di cs.columbia.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusEmail yang diverifikasi di mpi-inf.mpg.de
Ronald L. RivestMIT Institute ProfessorEmail yang diverifikasi di mit.edu

Ikuti

Robert Tarjan

Professor of Computer Science, Princeton University

Email yang diverifikasi di cs.princeton.edu

data structures graph algorithms analysis of algorithms


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Depth-first search and linear graph algorithms R Tarjan SIAM journal on computing 1 (2), 146-160, 1972	9797	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	4371	1987
A new approach to the maximum-flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988	3432	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	3131	1985
Self-adjusting binary search trees DD Sleator, RE Tarjan Journal of the ACM (JACM) 32 (3), 652-686, 1985	2006	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	1939	1979
Time bounds for selection M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan J. Comput. Syst. Sci. 7 (4), 448-461, 1973	1853	1973
Efficient planarity testing J Hopcroft, R Tarjan Journal of the ACM (JACM) 21 (4), 549-568, 1974	1815	1974
Algorithmic aspects of vertex elimination on graphs DJ Rose, RE Tarjan, GS Lueker SIAM Journal on computing 5 (2), 266-283, 1976	1755	1976
Three partition refinement algorithms R Paige, RE Tarjan SIAM Journal on computing 16 (6), 973-989, 1987	1740	1987
A data structure for dynamic trees DD Sleator, RE Tarjan Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981	1628	1981
Algorithm 447: efficient algorithms for graph manipulation J Hopcroft, R Tarjan Communications of the ACM 16 (6), 372-378, 1973	1603	1973
Fast algorithms for finding nearest common ancestors D Harel, RE Tarjan siam Journal on Computing 13 (2), 338-355, 1984	1529	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	1514	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	1340	1979
Dividing a graph into triconnected components JE Hopcroft, RE Tarjan SIAM Journal on computing 2 (3), 135-158, 1973	1200	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	1048	1977

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama