Publications
-
A Meta-Complexity Characterization of Quantum Cryptography
with
Eli Goldin, Matthew Gray, Peter Hall
EUROCRYPT 2025
[arXiv, IACR]
-
Boolean Circuit Complexity and Two-Dimensional Cover Problems
with
Igor C. Oliveira
ACM Transactions on Computation Theory (ToCT) 2025
[arXiv, ECCC, DOI]
-
On the Computational Hardness of Quantum One-Wayness
with
Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos
Quantum 9:1679 (2025)
[arXiv, Quantum]
-
Constant-Depth Circuits vs. Monotone Circuits
with
Igor C. Oliveira
CCC 2023
[arXiv, ECCC]
[MIAO seminar]
-
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
with
Zhenjian Lu
ITCS 2022
Journal: Algorithmica 85, 2131–2155 (2023)
[arXiv, ECCC]
-
Oriented Graphs with Lower Orientation Ramsey Thresholds
with
Gabriel Ferreira Barros,
Yoshiharu Kohayakawa,
Guilherme Oliveira Mota,
and
Tássio Naia
EUROCOMB 2021
Journal version: RAIRO-Oper. Res. 58 (2024) 3607–3619
[arXiv]
-
Orientation Ramsey Thresholds for Cycles and Cliques
with
Gabriel Ferreira Barros,
Yoshiharu Kohayakawa,
and
Tássio Naia
SIAM Journal on Discrete Mathematics (SIDMA), 35(4):2844– 2857, 2021
[arXiv]
-
Monotone Circuit Lower Bounds from Robust Sunflowers
with
Mrinal Kumar
and
Benjamin Rossman
LATIN 2020 (Alejandro López-Ortiz Best Paper Award)
Journal: Algorithmica 84(12):3655–3685, 2022
[arXiv, ECCC]
-
Anti-Ramsey Threshold of Cycles for Sparse Graphs
with
Gabriel Ferreira Barros,
Guilherme Oliveira Mota,
and
Olaf Parczyk
LAGOS 2019
Journal: Discrete Applied Mathematics 323:228–235, 2022
[arXiv]
Thesis
-
Complexity Theory of Classical and Quantum Computational Devices
PhD thesis
[PDF]
-
Sunflower Theorems in Monotone Circuit Complexity
MSc thesis
Best Master Thesis Award (Congress of the Brazilian Computer Society, CTD 2021)
[ECCC,
PDF]
-
Ramsey-type Problems in Orientations of Graphs
Undergraduate thesis
Updated version:
[arXiv]
Old version:
[PDF]