Academics

  /  

Courses

  /  

Descriptions

COMP_SCI 496: The Expansion Phenomenon in Computer Science

VIEW ALL COURSE TIMES AND SESSIONS

Prerequisites

CS 212 or CS 336 or Gen_Eng 205-1 or Math 240 or Math 306 or Math 334 or Instructor permission

Description

Graph expansion lies at the heart of many influential ideas in theoretical computer science, featuring time and again in landmark results on sampling algorithms, combinatorial optimization, error-correcting codes, pseudorandomness, and complexity theory.

This course offers a self-contained introduction to the spectral and combinatorial theory of expansion, along with key results from the last two decades

• This course fulfills the Technical Elective area.

COURSE COORDINATORS: Sidhanth Mohanty

COURSE INSTRUCTOR: Sidhanth Mohanty