EdusalsaDiscover Your Stanford

CS 168

The Modern Algorithmic Toolbox

  • spring

3 - 4 units

Letter or Credit/No Credit

This course will provide a rigorous and hands-on introduction to the central ideas and algorithms that constitute the core of the modern algorithms toolkit. Emphasis will be on understanding the high-level theoretical intuitions and principles underlying the algorithms we discuss, as well as developing a concrete understanding of when and how to implement and apply the algorithms. The course will be structured as a sequence of one-week investigations; each week will introduce one algorithmic idea, and discuss the motivation, theoretical underpinning, and practical applications of that algorithmic idea. Each topic will be accompanied by a mini-project in which students will be guided through a practical application of the ideas of the week. Topics include hashing, dimension reduction and LSH, boosting, linear programming, gradient descent, sampling and estimation, and an introduction to spectral techniques. Prerequisites: CS107 and CS161, or permission from the instructor.

Course Prequisites

Sections

spring
  • LEC

    • Monday Wednesday 1:30:00 PM - 2:50:00 PM @ McCullough 115 with Tim Roughgarden Gregory Valiant

      May be taken for 3 units by graduate students. Enrollment limited to 100. Consent of instructor required.

Sign Up

To save CS 168 to your course bucketlist

Already Have An Account? Log In