- Robert Tarjan. Sorting
using networks of queues and stacks. Journal of the
ACM, 19(2):341-346, April 1972.
Citations,
etc.
- John Hopcroft and Robert Tarjan. Efficient planarity testing.
Journal of the ACM, 21(4):549-568, October 1974.
References,
Citations,
etc.
- Robert Endre Tarjan. Efficiency of a good but not linear
set union algorithm. Journal of the ACM, 22(2):215-225,
April 1975.
Citations.
- S. Even and R. E. Tarjan. A
combinatorial problem which is complete in polynomial space.
Journal of the ACM, 23(4):710-719, October 1976.
Citations.
- Mark R. Brown and Robert E. Tarjan. A fast merging algorithm.
Journal of the ACM, 26(2):211-226, April 1979.
- Robert Endre Tarjan. Applications of path compression on
balanced trees. Journal of the ACM, 26(4):690-715,
October 1979.
Citations.
- Peter J. Downey, Ravi Sethi, and Robert Endre Tarjan. Variations on the common
subexpression problem. Journal of the ACM,
27(4):758-771, October 1980.
Citations.
- Robert Endre Tarjan. A
unified approach to path problems. Journal of the ACM,
28(3):577-593, July 1981.
Citations.
- Robert Endre Tarjan. Fast
algorithms for solving path problems. Journal of the
ACM, 28(3):594-614, July 1981.
Citations.
- Thomas Lengauer and Robert E. Tarjan. Asymptotically tight bounds on
time-space trade-offs in a pebble game. Journal of the
ACM, 29(4):1087-1130, October 1982.
References,
etc.
- Robert E. Tarjan and Jan van Leeuwen. Worst-case analysis of set union
algorithms. Journal of the ACM, 31(2):245-281, April
1984.
Citations.
- Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search
trees. Journal of the ACM, 32(3):652-686, July 1985.
Citations.
- Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in
improved network optimization algorithms. Journal of the
ACM, 34(3):596-615, July 1987.
Citations.
- Andrew V. Goldberg and Robert E. Tarjan. A new approach to the
maximum-flow problem. Journal of the ACM,
35(4):921-940, October 1988.
Citations.
- Andrew V. Goldberg and Robert E. Tarjan. Finding minimum-cost circulations
by canceling negative cycles. Journal of the ACM,
36(4):873-886, October 1989.
Citations.
- Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan.
Faster algorithms for
the shortest path problem. Journal of the ACM,
37(2):213-223, April 1990.
Citations.
- Harold N. Gabow and Robert E. Tarjan. Faster scaling algorithms for
general graph-matching problems. Journal of the ACM,
38(4):815-853, October 1991.
References,
Citations,
etc.
- James R. Driscoll, Daniel D. K. Sleator, and Robert E. Tarjan. Fully persistent lists with
catenation. Journal of the ACM, 41(5):943-959,
September 1994.
References
and Citations.
- David R. Karger, Philip N. Klein, and Robert E. Tarjan. A randomized linear-time algorithm
to find minimum spanning trees. Journal of the ACM,
42(2):321-328, March 1995.
Abstract,
References,
Citations,
etc.
Shortcuts: