Invitation to the 44th biannual Midwest Theory Day

The 44th Biannual
Midwest Theory Day

http://www.uiuc.edu/~thite/mtd

Saturday, December 1, 2001

Department of Computer Science
University of Illinois at Urbana-Champaign
Urbana, IL 61801

The Midwest Theory Day (MTD) is a biannual one-day conference on topics in theoretical computer science, hosted by a school in the Midwest. The atmosphere is relaxed and informal. There is no registration fee and no proceedings are published. Anybody interested in theoretical computer science is welcome to attend.

Please RSVP to thite@uiuc.edu if you plan to attend.

Schedule of talks

Date: December 1, 2001 (Saturday)
Time: 10:30am -- 6:00pm
Venue: 1310 Digital Computer Laboratory, 1304 W. Springfield Ave., Urbana, IL 61801.

Time Speaker(s) Title and Abstract

Session M (10:30 am -- noon)

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

4:15 -- 4:45 Teo Chung-Piaw,
Northwestern University and
National University of Singapore A Polynomial Time Algorithm for Bistable Roommates Problem

4:45 -- 5:00 pm Coffee break

Session A3 (5:00 -- 6:00 pm)

5:00 -- 5:30 Andy Poe,
Northern Michigan U. Load Balancing Multiweight Geometric Problems

5:30 -- 6:00 Predrag Tosic,
UIUC Phase Space Properties of Synchronous and Sequential Dynamical Systems

Time	Speaker(s)	Title and Abstract
Session M (10:30 am -- noon)
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
4:15 -- 4:45	Teo Chung-Piaw, Northwestern University and National University of Singapore	A Polynomial Time Algorithm for Bistable Roommates Problem
4:45 -- 5:00 pm	Coffee break
Session A3 (5:00 -- 6:00 pm)
5:00 -- 5:30	Andy Poe, Northern Michigan U.	Load Balancing Multiweight Geometric Problems
5:30 -- 6:00	Predrag Tosic, UIUC	Phase Space Properties of Synchronous and Sequential Dynamical Systems

More information:
http://www.uiuc.edu/~thite/mtd

Maps and directions:
http://www.uiuc.edu/navigation/maps/all_campus.html
http://www.uiuc.edu/navigation/maps/north_campus.html

Contact:
Shripad Thite
Department of Computer Science
University of Illinois at Urbana-Champaign
1304 West Springfield Avenue
Urbana, IL 61801

Email: thite@uiuc.edu
Phone: (217) 244-6433
Fax: (217) 244-6500