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.