Contents pg01: Metrical task systems, work functions, and deterministic potentials. Apr 3 07:06 2002 pg02: A deterministic lower bound of 2n-1 for any metric space of n points. Apr 3 08:42 2002 pg03: The WFA for metrical task systems. Apr 3 12:04 2002 pg04: Distribution potentials. Apr 9 16:49 2002 pg05: Behavioral potentials I. Apr 10 13:57:36 PDT 2002 pg06: Behavioral potentials II. Apr 10 13:15:53 PDT 2002 pg07: An optimally competitive randomized online algorithm for the ice-cream problem. Feb 28 06:12 2002 pg08: A lower bound of H_k For the randomized competitiveness of the UMTS problem with k states. Mar 20 15:14 2002 pg09: The randomized competitiveness of the UMTS problem for k = 2. Apr 9 17:42:20 PDT 2002 pg10: The randomized competitiveness of the UMTS problem for k >= 3. Apr 9 18:00:55 PDT 2002