Bruno Pasqualotto Cavalar

Orcid: 0000-0002-0458-8767

According to our database1, Bruno Pasqualotto Cavalar authored at least 14 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Monotone Circuit Complexity of Matching.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Negations Are Powerful Even in Small Depth.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

A Meta-complexity Characterization of Minimal Quantum Cryptography.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
On the Computational Hardness of Quantum One-Wayness.
Quantum, 2025

Boolean Circuit Complexity and Two-Dimensional Cover Problems.
Electron. Colloquium Comput. Complex., 2025

On Cryptography and Distribution Verification, with Applications to Quantum Advantage.
Electron. Colloquium Comput. Complex., 2025

A Meta-complexity Characterization of Quantum Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Directed graphs with lower orientation Ramsey thresholds.
RAIRO Oper. Res., 2024

2023
Constant-Depth Circuits vs. Monotone Circuits.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Anti-Ramsey threshold of cycles.
Discret. Appl. Math., 2022

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Orientation Ramsey Thresholds for Cycles and Cliques.
SIAM J. Discret. Math., 2021

2020
Monotone Circuit Lower Bounds from Robust Sunflowers.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Anti-Ramsey Threshold of Cycles for Sparse Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019


  Loading...