Ofer Grossman Thesis Defense; Title: Pseudo-determinism

Speaker

Ofer Grossman, MIT

Host

Thesis Committee: Shafi Goldwasser (Supervisor), Ronitt Rubinfeld and Vinod Vaikuntanathan
Abstract: When multiple parties solve the same algorithmic problem, they may come up with different valid outputs (this is especially common when using randomized algorithms). How can we construct algorithms that avoid this and reliably produce the same outputs?