I am a third-year PhD student in the Department of Computer Science and Technology at the University of Cambridge, where I am extremely fortunate to be under the supervision of Tom Gur. My research is in the area of theoretical computer science, and I am particularly interested in probabilisitic and zero-knowledge proof systems, coding theory, cryptography and complexity theory.
I am an 1851 Research Fellow at the Department of Computer Science and a College Research Associate affiliated to Sidney Sussex College. I formerly held positions as an Assistant Professor (Research-focused), Research Fellow, and Postdoctoral Research Associate in the Department of Computer Science at the University of Warwick between September 2020 and August 2023.
I am a postdoctoral research associate in the Logics and Algorithms group led by Anuj Dawar. My research interests revolve around logic and complexity. I especially enjoy to explore how methods from finite model theory can be used to prove lower bounds in other areas of theoretical computer science, such as proof complexity, algebraic complexity or the theory of constraint satisfaction problems.
Conference proceedings
Lichter, M., Pago, B. and Seppelt, T., 2024. Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability Leibniz International Proceedings in Informatics, LIPIcs, v. 288 Doi: 10.4230/LIPIcs.CSL.2024.36
Pago, B., 2023. Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits Leibniz International Proceedings in Informatics, LIPIcs, v. 272 Doi: 10.4230/LIPIcs.MFCS.2023.73
Pago, B., 2023. Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus Leibniz International Proceedings in Informatics, LIPIcs, v. 252 Doi: 10.4230/LIPIcs.CSL.2023.31
Pago, B., 2021. Choiceless computation and symmetry: Limitations of definability Leibniz International Proceedings in Informatics, LIPIcs, v. 183 Doi: 10.4230/LIPIcs.CSL.2021.33
Grädel, E., Pago, B. and Pakusa, W., 2017. The model-theoretic expressiveness of propositional proof systems Leibniz International Proceedings in Informatics, LIPIcs, v. 82 Doi: 10.4230/LIPIcs.CSL.2017.27
Journal articles
Dawar, A. and Pago, B., 2024. A Logic for P: Are we Nearly There Yet? ACM SIGLOG News, v. 11 Doi: 10.1145/3665453.3665459
Grädel, E., Grohe, M., Pago, B. and Pakusa, W., 2019. A Finite-Model-Theoretic view on propositional proof Complexity Logical Methods in Computer Science, v. 15 Doi: 10.23638/LMCS-15(1:4)2019
Theses / dissertations
Pago, B., 2023 (No publication date). Limitations of Choiceless Computation
Conference proceedings
2024
Lichter, M., Pago, B. and Seppelt, T., 2024. Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability Leibniz International Proceedings in Informatics, LIPIcs, v. 288 Doi: 10.4230/LIPIcs.CSL.2024.36
2023
Pago, B., 2023. Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits Leibniz International Proceedings in Informatics, LIPIcs, v. 272 Doi: 10.4230/LIPIcs.MFCS.2023.73
Pago, B., 2023. Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus Leibniz International Proceedings in Informatics, LIPIcs, v. 252 Doi: 10.4230/LIPIcs.CSL.2023.31
2021
Pago, B., 2021. Choiceless computation and symmetry: Limitations of definability Leibniz International Proceedings in Informatics, LIPIcs, v. 183 Doi: 10.4230/LIPIcs.CSL.2021.33
2017
Grädel, E., Pago, B. and Pakusa, W., 2017. The model-theoretic expressiveness of propositional proof systems Leibniz International Proceedings in Informatics, LIPIcs, v. 82 Doi: 10.4230/LIPIcs.CSL.2017.27
Journal articles
2024
Dawar, A. and Pago, B., 2024. A Logic for P: Are we Nearly There Yet? ACM SIGLOG News, v. 11 Doi: 10.1145/3665453.3665459
2019
Grädel, E., Grohe, M., Pago, B. and Pakusa, W., 2019. A Finite-Model-Theoretic view on propositional proof Complexity Logical Methods in Computer Science, v. 15 Doi: 10.23638/LMCS-15(1:4)2019
Theses / dissertations
2023 (No publication date)
Pago, B., 2023 (No publication date). Limitations of Choiceless Computation
