Midwest Theory Day
F A L L   2 0 0 1
University of Illinois at Urbana-Champaign

[ main page ]

Schedule of talks

Date: December 1, 2001 (Saturday)
Time: 10:30am -- 5:30pm
Venue: 1310 Digital Computer Laboratory

View all abstracts.

TimeSpeaker(s)Title and Abstract
Session M (10:30 am -- noon)
10:30 Prof. Marc Snir,
Head of Computer Science,
UIUC
Welcome to attendees
10:30 -- 11:00 Ashutosh Garg,
UIUC
Generalization Bounds for Linear Learning Algorithms
11:00 -- 11:30 Daniel Stefankovic,
U. Chicago
Marcus Schaefer,
DePaul
Recognizing String Graphs in NP
11:30 -- noon Chandra N. Sekharan,
Loyola
New Themes in the All-Pairs Shortest Path (APSP) Problem: A Survey
noon -- 1:30 Lunch break (Lunch will be provided to attendees free of charge.)
Session A1 (1:30 -- 3:00 pm)
1:30 -- 2:00 Thomas P. Hayes,
U. Chicago
Separating the Multiparty Communication Hierarchy
2:00 -- 2:30 Ken Takata,
U. Illinois, Chicago
On the complexity of listing minimal hitting sets
2:30 -- 3:00 Denis Charles,
U. Wisconsin, Madison
The distribution of Squarefree Smooth integers in Short Intervals
3:00 -- 3:15 pm Coffee break
Session A2 (3:15 -- 4:45 pm)
3:15 -- 3:45 Tanya Berger-Wolf,
UIUC
Multichannel Communication and Vertex Labeling of Graph Products
3:45 -- 4:15 Venkatesan Chakaravarthy,
U. Wisconsin, Madison
Some Karp-Lipton-Type theorems based on S_2
CANCELLED Teo Chung-Piaw,
Northwestern University and
National University of Singapore
A Polynomial Time Algorithm for Bistable Roommates Problem
4:15 -- 4:45 Andy Poe,
Northern Michigan U.
Load Balancing Multiweight Geometric Problems
4:45 -- 5:00 pm Coffee break
Session A3 (5:00 -- 5:30 pm)
5:00 -- 5:30 Predrag Tosic,
UIUC
Phase Space Properties of Synchronous and Sequential Dynamical Systems


[ main page ]

Shripad Thite
Last modified: Sat Nov 24 14:53:26 CST 2001