COMS W4232
Advanced Algorithms
Prerequisite: Analysis of Algorithms (COMS W4231). 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
Topics
- hashing
- sketching/streaming
- nearest neighbor search
- graph algorithms
- spectral graph theory
- linear programming
- models for large-scale computation
- and other related topics
Topics explicitly listed in official catalogue description
Prerequisites & course information
Prerequisites: see notes re: points COMS W4231
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Advanced Algorithms · 3.00 points · University catalogue