Notes on Introductory Combinatorics von Pólya, George, Tarjan, Robert E, Woods, Donald R

Volltext

Simple Concurrent Connected Components Algorithms von Liu, Sixue Cliff, Tarjan, Robert Endre

Volltext

Notes on Introductory Combinatorics von Pólya, George, Tarjan, Robert E, Woods, Donald R

Volltext

Self-adjusting binary search trees von SLEATOR, D. D, TARJAN, R. E

Volltext

Fast Algorithms for Finding Nearest Common Ancestors von Harel, Dov, Tarjan, Robert Endre

Volltext

A linear-time algorithm for a special case of disjoint set union von Gabow, Harold N., Tarjan, Robert Endre

Volltext

Thin heaps, thick heaps von Kaplan, Haim, Tarjan, Robert Endre

Volltext

Applications of Path Compression on Balanced Trees von Tarjan, Robert Endre

Volltext

A linear-time algorithm for testing the truth of certain quantified boolean formulas von Aspvall, Bengt, Plass, Michael F., Tarjan, Robert Endre

Volltext

The analysis of a nested dissection algorithm von Gilbert, John R., Tarjan, Robert Endre

Volltext

Fibonacci heaps and their uses in improved network optimization algorithms von FREDMAN, M. I, ENDRE TARJAN, R

Volltext

Variations on the Common Subexpression Problem von Downey, Peter J., Sethi, Ravi, Tarjan, Robert Endre

Volltext

A separator theorem for graphs of bounded genus von Gilbert, John R, Hutchinson, Joan P, Tarjan, Robert Endre

Volltext

A good algorithm for edge-disjoint branching von Tarjan, Robert Endre

Volltext

Amortized Computational Complexity von Tarjan, Robert Endre

Volltext

If Piracy Is the Problem, Is DRM the Answer? von Haber, Stuart, Horne, Bill, Pato, Joe, Sander, Tomas, Tarjan, Robert Endre

Volltext

A data structure for dynamic trees von Sleator, Daniel D., Endre Tarjan, Robert

Volltext

A class of algorithms which require nonlinear time to maintain disjoint sets von Tarjan, Robert Endre

Volltext

Efficiency of a Good But Not Linear Set Union Algorithm von Tarjan, Robert Endre

Volltext

Fast Algorithms for Solving Path Problems von Tarjan, Robert Endre

Volltext