NOON THEORY SEMINAR -- FALL
2004
Our informal group seminar meets most Fridays from 11-12, followed by a group
lunch. If you would like to give a talk please send me email.
Please note that due to scheduling constraints the theory seminar will be
moving between two rooms this semester; room 3464 (the Math-CS conference
room) and room 3501. Please check the week's listing for that week's
actual venue. Also, occasionally, talks will be given out of the
normal Friday, 11-12 slot. Such talks will be highlighted in red.
For information on how to get to HKUST see this and this.
| Date |
Location |
Speaker |
Title |
Sept 10, 2004
11-11:50
|
3464 |
David
Wagner
Dartmouth |
The Minimum Bends Path Problem in Three Dimensions
|
Sept 10, 2004
11-11:50 |
3464 |
Mordecai Golin
HKUST
|
Generalizing the Kraft-McMillan Inequality to Restricted Languages |
Sept 17, 2004
11-11:50 |
3464 |
Yo-Sub Han
HKUST
|
How to compute better regular expressions from finite-state automata
|
Sept 24 ,2004
11-11:50 |
|
NO SEMINAR
|
NO SEMINAR |
Oct 1, 2004
11-11:50 |
|
NO SEMINAR |
NO SEMINAR (National Day) |
Oct 8, 2004
11-11:50 |
3464 |
Wang Yajun
HKUST
|
Counting Structures in
Non-Constant-Jump Circulant Graphs |
Oct 15, 2004
11-11:50 |
3464 |
John Iacono
Polytechnic University
|
O(lg lg n)-competitive
Binary Search Trees |
Oct 22, 2004
11-11:50 |
|
NO SEMINAR |
NO SEMINAR (Chung Yeung) |
Oct 29, 2004
11-11:50 |
3464 |
Gerhard Trippen
HKUST
|
Towards a
Poly($d$)-competitive Online Exploration Algorithm for (Planar) Strongly
Connected Directed Graphs |
Nov 5, 2004
11-11:50 |
3464 |
Siu-Wing Cheng
HKUST
|
Sampling and Meshing a
Surface with Guaranteed Topology and Geometry |
Nov 12 , 2004
11-11:50 |
|
NO SEMINAR |
See
Distinguished lecture by Professor Andrew Yao on Saturday November
13, 2004, 11AM, Citigroup Lecture Theatre
|
Nov 19, 2004
11-11:50 |
3501 |
Zheng SUN
HK Baptist U
|
Cost Sharing and Strategyproof Mechanisms for Set Cover Games |
Nov 26, 2004
11-11:50 |
|
NO SEMINAR
|
NO SEMINAR |
Dec 3, 2004
11-11:50 |
3501 |
Wong Ka Chun
HKUST
|
Optimal Expected-Case
Planar Point Location |
Dec 10, 2004
11-11:50 |
3464 |
Lap Chi Lau
Toronto
|
An approximate
max-Steiner-tree-packing min-Steiner-cut theorem |
Archives of
Old Seminars, links and abstracts.
Web page maintained by
Mordecai Golin, HKUST Theoretical Computer Science
Group