For today’s meeting, Brian presented on the Secretary Problem, a classic example from optimal stopping and online algorithms.
The slides can be found here.
Previous: Communication complexity
Suhas presented on communication complexity (which sounds scarier than it is).
continue reading ❯