Manuel Sabin

UC Berkeley
Website Opens new tab

Manuel Sabin is in their last year of their PhD at UC Berkeley, advised by Shafi Goldwasser and Christos Papadimitriou. Their interests are most recently in:

– Fine-grained Complexity Theory, Pseudorandomness, Cryptography, Circuit Lower Bounds, and how these all influence each other.

– Algorithmic “Fairness” and examining technology and the field itself’s methodologies through an interdisciplinary, socio-technical lens.

Program Visits

Lower Bounds in Computational Complexity, Fall 2018, Visiting Graduate Student
Foundations of Machine Learning, Spring 2017, Visiting Graduate Student
Algorithmic Challenges in Genomics, Spring 2016, Visiting Graduate Student
Counting Complexity and Phase Transitions, Spring 2016, Visiting Graduate Student
Fine-Grained Complexity and Algorithm Design, Fall 2015, Visiting Graduate Student
Economics and Computation, Fall 2015, Visiting Graduate Student
Cryptography, Summer 2015, Visiting Graduate Student