BU CS Department Colloquia - Spring 2001

Wednesdays 11am or as noted 
Seminar Room / MCS 135

Coffee will be served at 10:45 in the seminar room.

February 7, 3pm
Analysis and Synthesis of Talking Faces

Lionel Reveret
Georgia Institute of Technology

Host: Stan Sclaroff
February 21, 11am
Forward-Secure Signatures with Optimal Signing and Verifying

Leonid Reyzin
Laboratory for Computer Science
Massachusetts Institute of Technology

Host: Gene Itkis
February 28, 3pm
Practical ESP: the set reconciliation problem

Ari Trachtenberg
Electrical and Computer Engineering
Boston University

Host: Gene Itkis
March 14, 11am
An Optimizing Compiler for Relaxed Memory Consistency Models

Jaejin Lee
Computer Science and Engineering Department
Michigan State University

Host: Richard West
Monday, March 19, 11am
Dependent Types in Practical Programming

Hongwei Xi
University of Cincinnati

Host: Ibrahim Matta
March 21, 11am
Provably Secure Protocols, and Everlasting Security

Yan Zong Ding
Harvard University

Host: Gene Itkis
Monday, March 26, 11am
Predictability of Access Patterns for Scientific and Commercial Applications

Leonidas Kontothanassis
Akamai

Host: Azer Bestavros
March 28, 11am
Efficient Algorithms for Geometric Clustering Problems

Magda Procopiuc
Department of Computer Science
Duke University

Host: Margrit Betke
Monday, April 2, 11am
Program Analysis Techniques for Pointers and Accessed Memory Regions

Radu Rugina
Department of Computer Science
University of California at Santa Barbara

Host: John Byers
April 4, 11am
Run-Time Support For Distributed Sharing in Safe Languages

Charlie Hu
Department of Computer Science
Rice University

Host: Rich West
Monday, April 9, 11am
Decentralized Data Consistency Protocols for Mobile and Wide-Area Environments

Ugur Cetintemel
Computer Science Department
University of Maryland

Host: Ibrahim Matta
Tuesday, April 17, 9:30am
Dynamic Querying of Data Streams with the dQUOB System

Beth Plale
College of Computing
Georgia Institute of Technology

Host: Margrit Betke
Friday, May 4, 11pm
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time

Shang-Hua Teng
Akamai/UIUC

Host: Azer Bestavros
Wednesday, June 20, 1pm
Duality Model of TCP and Queue Management Algorithms

Steven Low
California Institute of Technology

Host: John Byers
Monday, June 25, 4pm
Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory

Marcus Hutter
IDSIA Switzerland

Host: Peter Gacs 
Created on: 2001.01.01
Updated on: 2001.06.15
Maintainer: Margrit Betke
            betke@cs.bu.edu