Re: [theory students] [Theory of Computing Seminar] Theory seminar tomorrow with Faith Ellen (U. Toronto), 1-2PM

[Eric Bach <bach@xxxxxxxxxxx>]

We have room for one more at

lunch if you want to sign up.

Eric

---

From: Theory-seminar <theory-seminar-bounces@xxxxxxxxxxx> on behalf of Sandeep Silwal via Theory-seminar <theory-seminar@xxxxxxxxxxx>
Sent: Thursday, November 7, 2024 11:09 AM
To: theory-faculty@xxxxxxxxxxx <theory-faculty@xxxxxxxxxxx>; Theory-seminar@xxxxxxxxxxx <Theory-seminar@xxxxxxxxxxx>; theory-students@xxxxxxxxxxx <theory-students@xxxxxxxxxxx>
Subject: [Theory of Computing Seminar] Theory seminar tomorrow with Faith Ellen (U. Toronto), 1-2PM

 

Hi everyone,

Tomorrow we will have Faith Ellen from the University of Toronto giving a talk in our CS theory seminar. We will also have cookies! Note the time updated to 1-2pm in CS 3310.

Title: Why Extension-Based Proofs Fail

Abstract: A valency argument is an elegant and well-known technique for proving impossibility results in distributed computing. It is an example of an extension-based proof, which is modelled as an interaction between a prover and a protocol. I will discuss some impossibility results in distributed computing and explain why they cannot be obtained using extension-based proofs.

Bio: Faith Ellen earned her Ph.D. in computer science at Berkeley in 1982, under the direction of Richard Karp.  After three years on the faculty at the University of Washington, she moved to the University of Toronto in 1986, where she is now Professor of Computer
Science.  She became a Fellow of the ACM 2014. Her research interests span the theory of distributed computing, complexity theory and data structures.

If you would like to meet Faith, please sign up here.

Best,
Sandeep