Contents pg01: The server problem as a metrical task system. Finiteness. Apr 6 04:37 2002 pg02: The Double Cover algorithm for the k-server problem on the line. Mar 13 14:08 2002 pg03: A lower bound of k for the deterministic competitiveness of the k-server problem. Mar 20 13:48 2002 pg04: A lower bound of H_k for the randomized competitiveness of the k-server problem. [Available later.] pg05: HARMONIC, a memoryless randomized online algorithm for the k-server problem. Apr 1 15:50 2002 pg06: Random Slack, a memoryless randomized online algorithm for the k-server problem. [Under construction.] Apr 6 04:20 2002