Schedule of Events

CSE Building

Saturday, May 10, 2008 (Eastern Daylight Time)

• 10:00-10:30 Coffee

• 10:30-11:00 Anna Gilbert, Michigan.
  Combining geometry and combinatorics: a unified approach to sparse signal recovery

• 11:10-11:40 Ran Duan, Michigan.
  Bounded-leg distance and reachability oracles

• 11:50-12:20 Varsha Dani, Chicago
  Stochastic Linear Optimization under Bandit Feedback

• 12:30-2:00 Lunch

• 2:00-3:00 Petros Drineas, RPI.
  Randomized algorithms for the least-squares approximation problem

• 3:10-3:40 Joshua Grochow, Chicago.
  Complexity Classes of Equivalence Problems

• 4:10-4:40 Ye Du, Michigan.
  The Computation of Approximate Competitive Equilibrium is PPAD-hard

• 4:50-5:20 Kevin Compton, Michigan.
  A Probabilistic Transform for Algorithms on Random Permutations with a Specified Number of Inversions