Capital Area Theory Seminar: Fall 1997

The Capital Area Theory Symposia is an NSF sponsored series of symposia in theoretical computer science bringing computer scientists from around the world to the Capital area. The Symposia are given at the University of Maryland in cooperation with the Computer Science Department and UMIACS. NSF support under grant CCR-9401842 is gratefully acknowledged.

The seminar will meet at 4pm on Wednesday's in AVW 3258 unless noted otherwise.

Papers available here .

Aug 7: (AVW 3258) Rafi Hassin (Tel Aviv University), Approximating the MAX TSP

Sep 3: Eric Allender (Rutgers), Making nondeterminism unambiguous

Sep 10: Dave Mount (Maryland), Arora's (Latest) Approximation Algorithm for the TSP Problem

Sep 17: Carl Smith (Maryland), Team Learning as a Game

Sep 24: Randeep Bhatia (Maryland), Probabilistic approximation of metric spaces and its algorithmic applications

Oct 3 (FRIDAY) 11am (3258): Klaus Reinhard (Univ of Tubingen) Strict sequential P-completeness

Oct 8: Samir Khuller (Maryland), Linear Programming based Algorithms for Facility Location

Oct 15: Amnon Barak (Hebrew University), The MOSIX Multicomputer System for Cluster Computing

Oct 17 (FRIDAY 11am, 2460): Jie Wang (North Carolina), Average Complexity

Oct 22: Clyde Kruskal (Maryland), Complexity Theory of Efficient Parallel Computation

Oct 29: Leonid Zosin (Max Planck Institute), Relaxed Multi-Commodity Flow and its Application to the Design of Approximation Algorithms

Nov 4 (TUESDAY 3-4 pm): Richard Beigel (Lehigh), Geometry of Browsing

Nov 5: Uzi Vishkin (Maryland), An idea which transcended its original application

Nov 12: Giri Narasimhan (Memphis), Geometric Networks and Fault Tolerance

Nov 14 (FRIDAY 11-12 am): Judy Goldsmith (Kentucky), A good plan is hard to find

Nov 17 (MONDAY 11-12 am): Ken Regan (SUNY Buffalo), Polynomial Vicinity Circuits and Nonlinear Lower Bounds

Nov 21 (FRIDAY 11-12 am): Yoram Sussmann (Maryland), Local improvement methods for Facility Location

Dec 5 (FRIDAY 11-12am): David Williamson (IBM), Primal Dual Approximation Algorithms for Feedback Vertex Set Problems

Dec 16 (FRIDAY 11-12am): Don Fussell (UT Austin), Zero-Power and Teraop Computing with Delay Insensitive Circuits

Talks from previous semesters:

Contact: Send email to samir@cs.umd.edu for additional information. To join the theory-local mailing list, send email to smith@cs.umd.edu.