Computer Science
161 LECTURES · PAGE 5 OF 7
A More Efficient Sifting Lemma and a Stronger 3-Player Communication Lower Bound
Where Do Game Ideas Come From?
Lecture 17: Huffman Coding
Introduction to Linear Programming
CS25: Transformers United - Overview of Transformers
Introduction to Deep Learning
Tracking and Trusting AI in Medicine
AI In Healthcare Series: Leveraging GPT-5, Cosmos, and Predictive Models for Better Outcomes
Inside the Rise of AI in Healthcare: Open Evidence and Cyber Risks
Games as Teaching Tools
Abstraction and Simulation
Learning from Complexity II
Color-avoiding Paths
All-Pairs Min-Cut vs. All-Pairs Shortest-Path
Upper and Lower Bounds for the Linear Ordering Principle
Reed-Solomon Codes
Knowing Your Players
Puzzles
VC Dimensions and Regularity
Extended VC-dimension and Radon Type Theorems for Unions of Convex Sets
Understanding the Oracle
AI as Your Personal Health Partner
Reverse Mathematics of Complexity Lower Bounds, Part I
Lecture 16: Data Compression and Shannon's Noiseless Coding Theorem