Note Taking

9/26/00 Stefan Saroiu
9/28/00 Maya Rodrig
10/3/00 Aaron Shon
10/5/00 Wilmot Li
10/10/00 Yana Kadiyska
10/12/00 Tao Xie
10/17/00 Lubomira Dontcheva
10/19/00 Nan Li
10/24/00 Jia-Chi Wu
10/26/00 Gary Yngve
10/31/00 William Pentney
11/2/00 Andrew Whitaker
11/7/00 Ana-Maria Popescu
11/9/00 Midterm
11/14/00 Marianne Shaw
11/16/00 Li Zhang
11/21/00 Ashish Gupta
11/23/00 Thanksgiving
11/28/00 Seth Bridges
11/30/00 Mark Seigle
12/5/00 Pradeep Shenoy
12/7/00

Other Assignments

Kaustubh Deshmukh. Notes on a context-free grammar to generate strings of the form u#v such that u does not yield v because something goes wrong.

Julie Goldberg. A pedagogical proof of the Immerman-Szelepscenyi theorem.

Evan Schrier. Midterm solutions.

Krishna Gummadi. Reduction of PCP to not-everything problem for context-free grammars.

Charles Gordon. The exponential complexity of the circularity problem for attribute grammars.

Timothy James. The stuff between P and NP-complete, if any.