Spring 2004
Since Nov. 11, 2003
FastCounter by bCentral
|
|
Randomized Algorithms
|
Location: NTU CSIE Building 103
|
|
Meeting time: 2:20pm-5:20pm, Wednesday
|
| Randomness is versatile in developing provably efficient
algorithms and protocols. This course will explore a
collection of techniques for effectively using randomization
and for analyzing randomized algorithms, as well as examples
from a variety of settings and problem areas.
|
|