Capital Area Theory Seminar: Spring 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 2pm on Thursday's in AVW 2120 unless noted otherwise.

Jan 30: Samir Khuller (Maryland), Vehicle Routing

Feb 6: Katia Guimaraes (Brazil), Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem

Feb 13: Robert Pless (Maryland), Voronoi Diagrams of Moving Point Sets

Feb 20: Richard Beigel (Yale/Maryland/Lehigh), Faster Algorithm for the Maximum Independent Set Problem

Talk moved to 3:30pm Feb 27: Yoram Sussmann (Maryland), Multi Cost Spanning Trees

Mar 6: Sanjeev Khanna (Bell Labs), Constraint Satisfaction: A Study of the Approximability of Optimization Problems

Mar 13: Steve Kautz (Randolph-Macon Womens College), Resource-bounded randomness and maximal compression of binary sequences

Talk moved to 3:30pm Mar 20: Sudipto Guha (Stanford), Improved Approxmation Algorithms for Node Weighted Steiner Trees

Apr 3: Mark Carson (NIST/Maryland), The Maximum Latency Problem

Apr 10: Shimon Even (Technion/Bell Labs), The Layered Cross Product and its Application in Designing Layouts for Interconnection Networks

Apr 17: Leandros Tassiulas (Maryland), Resource Allocation Problems in Wired and Wireless Networks

Apr 23 (WED at 5pm in 4185): Richard Chang (UMBC), Commutative Queries

May 1: Yossi Matias (Bell Labs), How to Make Personalized Web Browsing Simple, Secure, and Anonymous

May 8: Randeep Bhatia (Maryland), Minimizing Service and Operation Costs of Periodic Scheduling

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.