Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture is a Q&A session before the exam, where the instructor answers students' questions about proving algorithm correctness, rank functions, message complexity, and equivalence relations. The session covers topics like proving algorithms, using rank functions, and understanding message complexity in distributed systems.