Capital Area Theory Seminar: Spring 1999

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-9732907 is gratefully acknowledged.

All talks in AVW 2120 from 2pm to 2:50pm unless otherwise posted.

• Jan 20 (Wed, 2 pm): Moses Charikar (Stanford). Title: Approximating a Finite Metric by O(n log n) Trees with Applications to Approximation Algorithms.

• Feb 10 (Wed, 2 pm): Sanjeev Khanna (Bell Labs). Title: On Multi-dimensional Packing Problems.

• Mar 3 (Wed, 2pm): Michael Bender (SUNY at Stony Brook). Title: New Algorithms and Metrics for Scheduling Job Streams.

• Mar 17 (Wed, 2 pm): Tao Jiang (McMaster). Title: Approximation Algorithms for Multiple Sequence Alignment. Room change: AVW 2460.

• TBA: Joseph Cheriyan (University of Waterloo). Title: Approximating minimum-size k-edge connected spanning subgraphs.

• Apr 28 (Wed, 2pm): Dannie Durand. Title: Rearrangements and Duplications in Genome Evolution.

• Apr 29 (Thu, 11am): Harry Buhrman. (CWI). Title: Quantum Communication Complexity.

• May 7 (Fri, 2pm): Alejandro Schaffer. (NIH). Title: Some Combintorial Algorithms Problems in Hunting Disease Genes. Special room: AVW 4406

Talks from previous semesters

• Fall 1998
• Spring 1998
• Fall 1997
• Spring 1997
• Summer and Fall 1996
• Spring 1996
• Fall 1995

Other cats

• Combinatorial Algorithms Test Sets
• Collaborative Agent Technology System
• Computing: The Australasian Theory Symposium
• Schrödinger's Cat