Подписаться
Robert Tarjan
Robert Tarjan
Professor of Computer Science, Princeton University
Подтвержден адрес электронной почты в домене cs.princeton.edu
Название
Процитировано
Процитировано
Год
Depth-first search and linear graph algorithms
R Tarjan
SIAM journal on computing 1 (2), 146-160, 1972
91971972
Fibonacci heaps and their uses in improved network optimization algorithms
ML Fredman, RE Tarjan
Journal of the ACM (JACM) 34 (3), 596-615, 1987
42121987
Data structures and network algorithms
RE Tarjan
Society for industrial and Applied Mathematics, 1983
32921983
A new approach to the maximum-flow problem
AV Goldberg, RE Tarjan
Journal of the ACM (JACM) 35 (4), 921-940, 1988
32881988
Amortized efficiency of list update and paging rules
DD Sleator, RE Tarjan
Communications of the ACM 28 (2), 202-208, 1985
30411985
Self-adjusting binary search trees
DD Sleator, RE Tarjan
Journal of the ACM (JACM) 32 (3), 652-686, 1985
19431985
Efficiency of a good but not linear set union algorithm
RE Tarjan
Journal of the ACM (JACM) 22 (2), 215-225, 1975
18901975
A separator theorem for planar graphs
RJ Lipton, RE Tarjan
SIAM Journal on Applied Mathematics 36 (2), 177-189, 1979
18481979
Algorithmic aspects of vertex elimination
DJ Rose, RE Tarjan
Proceedings of the seventh annual ACM Symposium on Theory of Computing, 245-254, 1975
17771975
Time bounds for selection
M Blum, RW Floyd, VR Pratt, RL Rivest, RE Tarjan
J. Comput. Syst. Sci. 7 (4), 448-461, 1973
17751973
Efficient planarity testing
J Hopcroft, R Tarjan
Journal of the ACM (JACM) 21 (4), 549-568, 1974
17481974
Three partition refinement algorithms
R Paige, RE Tarjan
SIAM Journal on computing 16 (6), 973-989, 1987
16771987
A data structure for dynamic trees
DD Sleator, RE Tarjan
Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981
15371981
Algorithm 447: efficient algorithms for graph manipulation
J Hopcroft, R Tarjan
Communications of the ACM 16 (6), 372-378, 1973
15151973
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
14821984
Fast algorithms for finding nearest common ancestors
D Harel, RE Tarjan
siam Journal on Computing 13 (2), 338-355, 1984
14751984
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
12791979
Dividing a graph into triconnected components
JE Hopcroft, RE Tarjan
SIAM Journal on computing 2 (3), 135-158, 1973
11631973
Making data structures persistent
JR Driscoll, N Sarnak, DD Sleator, RE Tarjan
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
11241986
Applications of a planar separator theorem
RJ Lipton, RE Tarjan
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 162-170, 1977
10041977
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20