Igor Carboni Oliveira is a researcher in the Computer Science Department at the University of Oxford. Previously, he was a postdoctoral fellow at the School of Mathematics at Charles University in Prague. He received his PhD in Computer Science from Columbia University in 2015, jointly advised by Rocco Servedio and Tal Malkin. Before that, he was a student at the University of Campinas in Brazil. His research focuses on computational complexity theory and its connections to algorithms, combinatorics, and mathematical logic. He is particularly interested in unconditional complexity lower bounds and their applications.
- Lower Bounds in Computational Complexity, Fall 2018. Research Fellow.