X-Nico

unusual facts about Tarjan



Similar

James Tarjan

Tarjan's last competitive tournament was the 1984 U.S. Championship at Berkeley, where he went out in style with a fine tied third, scoring 10.5/17.

K-server problem

The special case of metrics in which all distances are equal is called the paging problem because it models the problem of page replacement algorithms in memory caches, and was also already known to have a k-competitive algorithm (Sleator and Tarjan 1985).

Mitsubishi Electric America Foundation

MEAF is engaged in a three-year project between the Tarjan Center at UCLA and Students for the Advancement of Global Entrepreneurship (SAGE) to Include All Students in Entrepreneurial Leadership Programs.

Push–relabel maximum flow algorithm

The general algorithm has O(V^2 E) time complexity, while the implementation with FIFO vertex selection rule has O(V^3) running time, the highest active vertex selection rule provides O(V^2\sqrt{E}) complexity, and the implementation with Sleator's and Tarjan's dynamic tree data structure runs in O(V E \log(V^2/E)) time.

The Two Towers

In 1999, the Lifeline Theatre in Chicago presented the world première of The Two Towers, adapted for the stage by James Sie and Karen Tarjan, directed by Ned Mochel.


see also