Course Schedule and Catalog

Department: Computer Science

Meeting: 4:00PM - 5:15PM W (11-JAN-2027 - 23-APR-2027) 

Part of Term: Full Term

Grade Mode: Standard Letter

Course Type: Seminar

Language of Instruction: Taught in English

Method of Instruction: Face to Face

Credit Hours: 1 OR 3

 

Section Max Enrollment: 30

Section Enrolled: 0

Enrollment data as of: 2-NOV-2026 5:48AM

 

 

Final Exam: GR Course-Dept Schedules Exam

 

Description: In the era of large-scale data analysis, efficient algorithm design is important in nearly every area of computer science. In this seminar, we will delve into some of the most powerful algorithmic techniques for analyzing such large-scale data. The seminar is intended as an introductory graduate level course for students interested in theoretical aspects of computation, but senior undergraduate students with a solid algorithmic and mathematical background might also enjoy the seminar. The seminar will be relatively broad and cover topics in randomized algorithms, streaming and sketching, sublinear algorithms, hashing, online algorithms, and differential privacy. The goal is to bring students up to level with different contemporary research directions in algorithms, enabling them to read, understand, and present theoretical research papers, and potentially pursue research in the covered areas themselves. The seminar is theoretical and proof heavy. It is a prerequisite that students are familiar with algorithm design and rigorous mathematical reasoning about algorithms, in addition to having mathematical maturity. Recommended Prerequisite(s): COMP 382, or equivalent algorithms background