A growing collection of talks I've given, with slides and recordings when available.
2026
-
The CNF Encoding Complexity of Boolean Functions
Theory Lunch, Carnegie Mellon University · Pittsburgh
-
Breaking down graphs into structured pieces, optimally and efficiently
LIACS, Leiden University · Online
-
SAT Solving for the Discrete Mathematician's Toolbox
MAA MathFest — Computers and Combinatorics · Boston
-
Optimal and Efficient Partite Decompositions of Hypergraphs
STOC 2026 · Salt Lake City
-
Compact CNF Encodings for Boolean Functions
Dagstuhl Seminar 26221 — Knowledge Compilation in Artificial Intelligence, Databases, and Formal Methods · Dagstuhl
-
Price of Locality in Permutation Mastermind: Are TikTok Influencers Chaotic Enough?
FUN 2026 · Porquerolles
-
Breaking down graphs and hypergraphs into structured pieces, optimally and efficiently
Université Clermont-Auvergne · Clermont-Ferrand
-
Breaking down graphs and hypergraphs into structured pieces, optimally and efficiently
Theory Lunch, Carnegie Mellon University · Pittsburgh
-
SAT Encodings: From Art to Science
Doctoral thesis proposal, Carnegie Mellon University · Pittsburgh
-
Price of Locality in Permutation Mastermind: Are TikTok influencers chaotic enough?!
Math Club, Carnegie Mellon University · Pittsburgh
-
Breaking down graphs and hypergraphs into structured pieces, optimally and efficiently
ACO Seminar, Carnegie Mellon University · Pittsburgh
2025
-
Optimal d-Clique Decompositions for Hypergraphs
AGCO Seminar, Pontificia Universidad Católica de Chile · Santiago
-
Computer-Assisted Intuition: SAT Solvers in Mathematical Discovery
Simons Institute / SLMath — AI for Mathematics and Theoretical Computer Science · Berkeley
-
Automated Reasoning for the Discrete Mathematician
Joint Mathematics Meetings — 35th Anniversary of AI and Math · Seattle
2024
-
A Demi-god's Number for the Rubik's Cube
Math Club, Carnegie Mellon University · Pittsburgh
-
Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
CICM 2024 · Montréal
-
SAT-Solving for the Packing Chromatic Number of the Infinite Grid
Theory Lunch, Carnegie Mellon University · Pittsburgh
2023
-
Explaining Decision Trees is Harder Than You Would Think!
Theory Lunch, Carnegie Mellon University · Pittsburgh
2022
-
On Computing Probabilistic Explanations for Decision Trees
NeurIPS 2022 — recorded presentation
-
Power to computers, Power to the people: from computer-aided mathematics to formal explainability
Invited talk, Stanford University · Stanford
-
The Packing Chromatic Number of the Infinite Square Grid is at Least 14
SAT 2022 · Haifa
-
Augmenting Online Algorithms with ε-Accurate Predictions
AGCO Seminar, CMM, Universidad de Chile · Santiago
-
The Exciting Theory of Formal Explanations
Invited talk, Logic-based Methods in Machine Learning (LMML), FLoC 2022 · Haifa
2021
-
Foundations of Symbolic Languages for Model Interpretability
NeurIPS’21 @ Paris — spotlight talk, Sorbonne Center on Artificial Intelligence · Paris
-
Interpretabilidad en Machine Learning con garantías formales
IV Escuela IMFD, Jornadas Chilenas de Computación · Online
-
Foundations of Symbolic Languages for Model Interpretability
NeurIPS 2021 — recorded spotlight presentation
-
Árboles y diagramas de decisión: operaciones y equivalencias
Seminario sobre Manejo de Datos y Teoría de la Computación, DataLab UC · Online
-
Foundations of Languages for Interpretability
LINKS Seminar, Inria / Université de Lille · Online
2020
-
Model Interpretability through the Lens of Computational Complexity
NeurIPS 2020 — recorded presentation