| Call Number | 11978 |
|---|---|
| Day & Time Location |
TR 2:40pm-4:00pm To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Alexandr Andoni |
| Type | LECTURE |
| Method of Instruction | In-Person |
| Course Description | Introduces classic and modern algorithmic ideas that are central to many areas of Computer Science. The focus is on most powerful paradigms and techniques of how to design algorithms, and how to measure their efficiency. The intent is to be broad, covering a diversity of algorithmic techniques, rather than be deep. The covered topics have all been implemented and are widely used in industry. Topics include: hashing, sketching/streaming, nearest neighbor search, graph algorithms, spectral graph theory, linear programming, models for large-scale computation, and other related topics |
| Web Site | Vergil |
| Department | Computer Science |
| Enrollment | 44 students (80 max) as of 5:06PM Thursday, January 2, 2025 |
| Subject | Computer Science |
| Number | W4232 |
| Section | 001 |
| Division | School of Engineering and Applied Science: Graduate |
| Open To | Barnard College, Columbia College, Engineering:Undergraduate, Engineering:Graduate, GSAS, General Studies, Journalism |
| Section key | 20251COMS4232W001 |