THEORY SEMINAR – Fall 2012

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, Aug 31	4483	Qin Zhang MADALGO, Aarhus University	Tight Bounds for Distributed Streaming
Friday, Oct 12	3408	Yajun Wang MSRA	Algorithms for submodular matroid secretary problems
Friday, Oct 26	3301A	Marek Chrobak UC Riverside	A Greedy Approximation Algorithm for Minimum-Gap Scheduling
Friday, Nov 9	4472	Konstaninos Tsakalidis HKUST	Dynamic Planar Range Maxima in Internal and External Memory
Friday, Nov 23	3402	Naoki Katoh Kyoto University	Enumerating Minimally Rigid Body-Hinge Graphs with Application to Architectural Design
Thursday, Dec 13	5508	Zhiyi Huang UPenn	Algorithms for the Generalized Sorting Problem
Friday, Dec 14 4-5pm	5508	Konstaninos Tsakalidis HKUST	An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine

Archives of Old Seminars, links and abstracts.

Web page maintained by
Ke Yi, HKUST Theoretical Computer Science Group