Abrahim Ladha gave a talk on provable security and cryptographic proofs.
The slides can be found here.
Previous: Network Flows
Arvind gave a talk about network flows today (including the max-flow min-cut theorem and its proof, the Ford-Fulkerson Algorithm, and applications).
continue reading ❯