In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
will defend his dissertation proposal
Secure and Efficient Algorithms for Fundamental Distributed Computing Problems
In the first part of our work, we look at message-efficient distributed algorithms for the leader election problem. We give tight upper and lower bounds for both randomized and deterministic leader election algorithms for networks with diameter two. In the second part of our algorithm, we look at Byzantine fault-tolerant algorithms for some fundamental distributed computing problems.
Date: Monday, December 3, 2018
Time: 2:30 PM
Place: PGH 550
Advisors: Dr. Gopal Pandurangan
Faculty, students, and the general public are invited.