Randomized Algorithms and Applications

CS 262




Course Description:

Design and analysis of algorithms which incorporate randomness in their design. Applications will be given in several of the following areas: data structures, pattern matching, cryptography, parallel computing, distributed computing, and interactive proof systems.
 
Prerequisite: CS 154 or CS 155.



Course Details:

Spring 2012 GreenSheet SamplePresentation Schedule



Navigation:

< Back to Dr. Moh's Home Page > | < Back to Department's Home Page >

< San Jose State University >