Capital Area Theory Seminar: Fall 1995
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 normally meets at 4pm on Thursday's in AVW 2120.
There will be a few special talks as well.
-
Aug 28 (Mo, 11am): K. Cerans (Latvia), Deciding properties of integral relational automata
-
Aug 29 (Tu, 4pm): Amotz Bar-Noy (Tel-Aviv),
Guaranteeing Fair Service to Persistent Dependent Tasks
- Sep 14: Ami Amir(Georgia Tech),
A Practical Algorithm for Generalized Random Sampling
- Sep 15 (Fri 11am): Lance Fortnow (Chicago),
Using Autoreducibility to Separate Complexity Classes
- Sep 21: Randeep Bhatia (Maryland),
The Loading Time Scheduling Problem
- Sep 28: Margrit Betke (Maryland),
Piecemeal Graph Exploration
- Oct 5: Dave Mount (Maryland),
Points, Well-separated Pairs, and Spanners
- Oct 12: Rod Downey (Wellington),
Positive techniques for parametric complexity: Automata, Courcelle's Theorem and Seese's Theorem
- Oct 16 (Mon 11am): Steve Rudich (CMU),
Natural Proofs
- Oct 19: Yoram Sussmann (Maryland),
On the asymmetric p-center problem
- Oct 26: Bill Gasarch (Maryland),
Determining the Majority
- Nov 2: Robert Pless (Maryland),
On the Planar TSP problem
- Nov 9: Avishai Wool (Weizmann),
Crumbling Walls: A Class of Practical and Efficient Quorum Systems
- Nov 10 (Fri 11am): Ruth Silverman (U DC),
Algorithms for nearest neighbor searching
- Nov 16: Ann Trenk,
Unit vs. Proper for Generalizations of Interval Graphs
- Nov 30: Samir Khuller (Maryland),
Low Degree Spanning Trees
- Dec 7: Teresa Przytycka (Odense U),
Comparing Evolutionary Trees
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.