For presentations of a particular paper, see Publications.
Survey presentations
- Proofs, Circuits and Total Search Problems (Meta-Complexity Boot Camp, Simons Institute, Jan 2023)
- Automatability: The Proof Search Problem (Meta-Complexity Boot Camp, Simons Institute, Jan 2023)
- Average-Case Hardness in Proof Complexity (Rigorous Evidence for Information-Computation Trade-offs, Simons Institute, Sept 2021)
- Non-Automatability: When Finding Proofs Is Provably Hard (Theoretical Foundations of SAT/SMT Solving, Simons Institute, May 2021)
- Proofs and Circuits: Connections via Interpolation and Lifting (50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing, Simons Institute, Mar 2021)
In Portuguese