THEORY SEMINAR – Spring 2013

This semester, the theory seminars meet on Fridays at 11-12, followed by a group lunch.  Occasionally, talks will be given out of the normal Friday 11-12 slot.
Talk announcements will be sent to the cstheory mailing list. If you would like to be on the list or to give a talk, please contact me.

Of related interest,  there is a also a weekly student run theory reading group that reads and discusses a new paper every week.

For information on how to get to HKUST, see this.

Date

Location

 Speaker

Title


Friday, March 8

3501

Yuan Zhou, CMU

Approximability and Proof Complexity


Friday, April 12

3402

Yuya Higashikawa, Kyoto University

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks

 

Friday, April 24

 

3501

John Augustin, IIT Madras

Random Walks Despite Heavy Churn With Application To Storing and Retrieving Data Items

 

Friday, May 31

 

 

Antoine Vigneron, KAUST

A Faster Algorithm for Computing Motorcycle Graphs


Friday, June 21

3311

Lu Wang, HKUST

Quantiles over Data Streams


Monday, Aug 12

3501

Uri Zwick, Tel-Aviv University

A forward-backward algorithm for single-source shortest paths


Thursday, Aug 15

3501

Xiaoming Sun, CAS

On the sensitivity complexity of Boolean functions

 
Archives of Old Seminars, links and abstracts.
 
Web page maintained by
Ke Yi,
HKUST Theoretical Computer Science Group