March 29:   Bounds for Certain Multiprocessor Anomalies, by Ron Graham.
		The Bell System Technical Journal, Nov 1966. 

March 31:   Amortized Efficient of List Update and Paging Rules, by Sleator and Tarjan.
		Communications of the ACM,  February 1985.

April 5:    Competitive Paging Algorithms, by Fiat,  Karp, Luby, Mcgeoch, Sleator, Young.
		Journal of Algorithms, 12, 1991.

April 7:    Planar Separator Theorem and its Applications, by Lipton and Tarjan.
		SIAM J. Computing, 615-627, 1980.

April 12:   Separator Theorem Application (finish)
	    Making Data Structures Persistent, by Driscoll, Sarnak, Tarjan, and Sleator.
            Journal of Computer Syst. Sci. 38(1): 86-124, 1989

April 14:   A Theory of the Learnable, by Leslie Valiant.
		Communications of the ACM, Volume 27, November 1984


April 19:   Learning continued


April 21:   Sorting and Selection with Limited Storage
	    Munro and Paterson


April 26:   The Probabilistic Method


April 28:   Geometric Complexity: Shamos and Bentley Papers


May 3:	    Sub-Cubic All-Pair Shortest Paths


May 5:		Luca Foschini   (PST proof)

May 10:		Wei Zhang 	(Complexity of Enumeration Problems)

May 12:		Lijie Ren       (Online learning in online auctions)

May 17:		Siladitya Dey   (On minimum and maximum spanning tress of moving points)

May 19:		Hakan Yildiz    (How many lions are needed to clear a grid?)

May 24:		Shane Zamora    (The k-Traveling Repairmen problem)

May 26:		Xun Tang        (The Worst Page-Replacement Policy) 

May 31:		** University Holiday **

June 2: