| Limiting probabilities of first order properties of random sparse graphs and hypergraphs A Larrauri, T Müller, M Noy Random Structures & Algorithms 60 (3), 506-526, 2022 | 8 | 2022 |
| Solving promise equations over monoids and groups A Larrauri, S Živný ACM Transactions on Computational Logic 26 (1), 1-24, 2024 | 2 | 2024 |
| Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas LA Larrauri Journal of Logic and Computation 31 (2), 444-472, 2021 | 2 | 2021 |
| Industry Paper: Surrogate Models for Testing Analog Designs under Limited Budget–a Bandgap Case Study R Bloem, A Larrauri, R Lengfeldner, C Mateis, D Ničković, B Ziegler 2022 International Conference on Hardware/Software Codesign and System …, 2022 | 1 | 2022 |
| Minimization and Synthesis of the Tail in Sequential Compositions of Mealy Machines A Larrauri, R Bloem arXiv preprint arXiv:2105.10292, 2021 | 1 | 2021 |
| Synthesis of Controllers for Continuous Blackbox Systems B Maderbacher, F Windisch, A Larrauri, R Bloem International Conference on Verification, Model Checking, and Abstract …, 2025 | | 2025 |
| Optimal Inapproximability of Promise Equations over Finite Groups S Butti, A Larrauri, S Živný arXiv preprint arXiv:2411.01630, 2024 | | 2024 |
| First Order Logic of Sparse Graphs with Given Degree Sequences A Larrauri, G Perarnau arXiv preprint arXiv:2405.14836, 2024 | | 2024 |
| Conformance Testing of Mealy Machines Under Input Restrictions A Larrauri, R Bloem arXiv preprint arXiv:2206.07441, 2022 | | 2022 |
| First order logic of sparse hyper-graphs LA Larrauri Borroto Universitat Politècnica de Catalunya, 2019 | | 2019 |
| First order logic of sparse hyper-graphs LAL Borroto Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística, 2019 | | 2019 |
| Introducción a la Teoría de Esquemas LA Larrauri Borroto, F Montaner Frutos | | |
