| Date |
Location |
Speaker |
Title |
Feb 18, 2005
11-11:50
|
3464 |
Hyeonsuk NA
Soongsil University |
Roofs over a rectilinear
simple polygon
|
Feb 25, 2005
11-11:50 |
3464 |
Zhou Zhen
CS, HKUST
|
Fast Scheduling for
Optical Packet Switches with Minimum Configurations |
March 4, 2005
11-11:50 |
3464 |
Zhou Xu
IEEM, HKUST
|
The Bottleneck Problem
with Minimum Quantity Commitments |
March 11, 2005
11-11:50 |
4480
special room |
Lusheng WANG
CityU of Hong Kong
|
Randomized Algorithms
for Motif Detection |
March 18, 2005
11-11:50 |
3464 |
Chen Xi
Tsinghua University
|
Matching Algorithmic
Bounds for Finding a Brouwer Fixed Point |
March 25, 2005
11-11:50 |
|
No Seminar (public holiday)
|
|
April 1, 2005
11-11:50 |
|
No Seminar
|
|
April 8, 2005
11-11:50 |
3464 |
Yo-Sub Han
HKUST
|
Prefix-Free
Regular-Expression Matching |
April 15, 2005
11-11:50 |
3464 |
Ming Li
Waterloo
|
Average-case analysis,
Shellsort, and Kolmogorov complexity |
April 22, 2005
11-11:50 |
3464 |
Gerhard Trippen
HKUST
|
Exploring an Unknown
Graph Efficiently |
April 29, 2005
11-11:50 |
3464 |
Li Minming
Tsinghua University
|
An Efficient Algorithm
for Computing Optimal Discrete Voltage Schedules |
May 6, 2005
11-11:50 |
3464 |
Theocharis Malamatos
Max-Planck Institute
|
Approximate Range
Counting |
May 13, 2005
11-11:50 |
3464 |
John Iacono
Polytechnic University
|
Cache-oblivious data structures |
June 21, 2005
11-11:50
|
3464 |
Franz Aurenhammer
Technische Universitaet
Graz |
Pre-Triangulations and
Liftable Complexes |
August 25, 2005
11-11:50
|
3464 |
R. Ravi
Carnegie
Mellon University |
Approximation Algorithms
for Stochastic Problems |