EdusalsaDiscover Your Stanford

CS 265

Randomized Algorithms and Probabilistic Analysis (CME 309)

  • autumn

3 units

Letter or Credit/No Credit

Randomness pervades the natural processes around us, from the formation of networks, to genetic recombination, to quantum physics. Randomness is also a powerful tool that can be leveraged to create algorithms and data structures which, in many cases, are more efficient and simpler than their deterministic counterparts. This course covers the key tools of probabilistic analysis, and application of these tools to understand the behaviors of random processes and algorithms. Emphasis is on theoretical foundations, though we will apply this theory broadly, discussing applications in machine learning and data analysis, networking, and systems. Topics include tail bounds, the probabilistic method, Markov chains, and martingales, with applications to analyzing random graphs, metric embeddings, random walks, and a host of powerful and elegant randomized algorithms. Prerequisites: CS 161 and STAT 116, or equivalents and instructor consent.

Course Prequisites

Sections

autumn
  • LEC

Sign Up

To save CS 265 to your course bucketlist

Already Have An Account? Log In