X-Nico

Daniel Sleator

Sleator has hosted the progressive talk show Left Out on WRCT-FM with fellow host and School of Computer Science faculty member Bob Harper.

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).

•

The problem was first posed by Mark Manasse, Lyle A. McGeoch and Daniel Sleator (1990).

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\backslash sqrt\{E\})$ complexity, and the implementation with Sleator's and Tarjan's dynamic tree data structure runs in $O(V\; E\; \backslash log(V^2/E))$ time.

see also