Midwest Theory Day
 
D e P a u l   U n i v e r s i t y
A u t u m n   2 0 0 3

 

The forty-seventh Midwest Theory Day will be hosted by the Department for Computer Science, Telecommunications, and Information Systems (CTI) at DePaul University on Saturday, December 13th, 2003.
NOTE that this is the second Saturday in December. The meeting will take place in the DePaul Center, Room 8005 (8th floor). The DePaul Center is located on 1 East Jackson Boulevard at the intersection of Jackson (200 South), and Wabash.  (directions to the building) 

 

Background

The Midwest Theory Day is held twice a year, usually on a Saturday in December and on a Saturday in April.  Anyone interested in theoretical computer science is welcome to attend.  There is no registration fee, lunch is provided, and the talks are scheduled so that it is often possible to come, attend all of the talks, and return home all in a day.  For those wishing to stay into the evening, arrangements for a banquet dinner are made at a local restaurant, each person paying for his or her own meal.  

Usually, there are seven or eight contributed talks and often an invited talk.  There is no program committee and there are no proceedings.  Anyone willing to talk may do so.  The atmosphere is relaxed and informal.  It is an excellent forum for graduate students to gain experience giving a talk.   

 

Talks and Schedule

 

10:00-10:20 Coffee/Tea    
10:20-10:45 Mohammad Sarwat Illinois Institute of Technology Bounded-Hops Power Assignment in Ad-Hoc Wireless Networks
10:45-11:10  Yi Zhang University of Illinois at Chicago Efficient algorithms for the inverse protein folding problem in 2D and 3D lattices
 11:10-11:35  Khaled Alzoubi Saint Xavier University Distributed heuristics for weakly-connected dominating sets and sparse spanners in unit-disk graphs
11:35-12:00
Gopal Pandurangan
 Purdue University The Bin-Covering Technique for Thresholding Random Geometric Graph Properties
 
12:00-1:30 Lunch Break    
1:30-2:30 Lance Fortnow University of Chicago  Computational Issues in Information Markets (Invited Talk)
 2:30-2:55  Andrew Mertz University of Kentucky On the complexity of multi-covering radii
  2:55-3:20  Rajiv Raman University of Iowa Buffer minimization using max-coloring
3:20-3:50 Coffee/Tea Break    
 3:50-4:15   Ganesh Venkataraman University of Iowa Graph decomposition and a greedy algorithm for edge disjoint paths
4:15-4:40 Robert Schweller  Northwestern University Complexities for Generalized Models of Self-Assembly
 
4:40-5:05 David Bunde University of Illinois at Urbana-Champaign Combining algorithms for acceptance and rejection
5:05-5:30 Sung-il Pae University of Illinois at Urbana-Champaign The Optimality of Random Number Generation from Biased Coin

 

Dinner

If there is enough interest, we will be heading for dinner at a downtown restaurant afterwards. Note that each person will be paying for his/her own meal. Dinner should take place around 6:30. Announcements about the dinner, and the dinner location, will be made at the venue.

 

Parking

You might be able to find street parking on a Saturday morning in the loop. If not (or if there are time limits), you can try the following parking garages:

 

For questions/information please email: ikanj@cs.depaul.edu