We are meeting Wednesdays from 2:00 to 3:00 in room 203 of the computer science building. Presentations are on topics in the theory of computation -- broadly construed. This is sometimes new research by visitors or by local people. work in progress, or recent or classic material of others that some of us present in order to learn and share. This is a one-credit seminar which may be taken repeatedly for credit.
If you would like to give a talk, please contact me at pweis@cs.umass.edu. The following schedule is tentative. Email announcements are sent out a couple of days before each talk.
| Wed, Feb 28 | Neil Immerman: Descriptive Complexity |
| Wed, March 28 | Brent Heeringa: Approximating Optimal Binary Decision Trees |
| Wed, April 4 | Philipp Weis: Formula Size and Number of Variables in Descriptive Complexity |
| Wed, April 18 | Louis Theran: Rigidity for Triangle Areas |
| Mon, April 23 | Siddharth Srivastava: Using Abstraction for Generalized Planning |
| Wed, May 2 | Shashi Shekhar Singh: Using Network Coding to Achieve Optimal Throughput for Multicasting |
| Wed, May 9 | Michael Sindelar: The Work Function Algorithm for the Online k-Server Problem |
| Mon, May 14 | David Mix Barrington: Monotone Planar Circuits |