Anti-Ramsey Threshold of Cycles for Sparse Graphs. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Guilherme Oliveira Mota; Olaf Parczyk (LAGOS, 2019)

Monotone Circuit Lower Bounds from Robust Sunflowers. - Bruno Pasqualotto Cavalar; Mrinal Kumar 001; Benjamin Rossman (Electron. Colloquium Comput. Complex., 2020)

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. - Bruno Pasqualotto Cavalar; Zhenjian Lu (Electron. Colloquium Comput. Complex., 2021)

Orientation Ramsey Thresholds for Cycles and Cliques. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Yoshiharu Kohayakawa; Tássio Naia (SIAM J. Discret. Math., 2021)

Anti-Ramsey threshold of cycles. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Guilherme Oliveira Mota; Olaf Parczyk (Discret. Appl. Math., 2022)

Constant-depth circuits vs. monotone circuits. - Bruno Pasqualotto Cavalar; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2023)

A Meta-Complexity Characterization of Quantum Cryptography. - Bruno Pasqualotto Cavalar; Eli Goldin; Matthew Gray; Peter Hall (Electron. Colloquium Comput. Complex., 2024)

Directed graphs with lower orientation Ramsey thresholds. - Gabriel Ferreira Barros; Bruno Pasqualotto Cavalar; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Tássio Naia (RAIRO Oper. Res., 2024)

Monotone Circuit Complexity of Matching. - Bruno Pasqualotto Cavalar; Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Boolean Circuit Complexity and Two-Dimensional Cover Problems. - Bruno Pasqualotto Cavalar; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2025)

On the Computational Hardness of Quantum One-Wayness. - Bruno Cavalar; Eli Goldin; Matthew Gray; Peter Hall; Yanyi Liu; Angelos Pelecanos (Quantum, 2025)