Minimization and Synthesis of the Tail inSequential Compositions of Mealy Machines. - Lázaro Alberto Larrauri; Roderick Bloem (CoRR, 2021)

Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas. - Lázaro Alberto Larrauri (J. Log. Comput., 2021)

Industry Paper: Surrogate Models for Testing Analog Designs under Limited Budget - a Bandgap Case Study. - Roderick Bloem; Alberto Larrauri; Roland Lengfeldner; Cristinel Mateis; Dejan Nickovic; Björn Ziegler (CODES+ISSS, 2022)

Conformance Testing of Mealy Machines Under Input Restrictions. - Alberto Larrauri; Roderick Bloem (CoRR, 2022)

Limiting probabilities of first order properties of random sparse graphs and hypergraphs. - Lázaro Alberto Larrauri; Tobias Müller 001; Marc Noy (Random Struct. Algorithms, 2022)

First Order Logic of Sparse Graphs with Given Degree Sequences. - Alberto Larrauri; Guillem Perarnau (CoRR, 2024)

Synthesis of Controllers for Continuous Blackbox Systems (artifact). - Benedikt Maderbacher; Felix Windisch; Alberto Larrauri; Roderick Bloem (Zenodo, 2024)

Optimal Inapproximability of Promise Equations over Finite Groups. - Silvia Butti; Alberto Larrauri; Stanislav Zivný (ICALP, 2025)

Synthesis of Controllers for Continuous Blackbox Systems. - Benedikt Maderbacher; Felix Windisch; Alberto Larrauri; Roderick Bloem (VMCAI (2), 2025)

Solving Promise Equations over Monoids and Groups. - Alberto Larrauri; Stanislav Zivný (ACM Trans. Comput. Log., 2025)

Equations over Finite Monoids with Infinite Promises. - Alberto Larrauri; Antoine Mottet; Stanislav Zivný (CoRR, 2025)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems. - Alberto Larrauri (CoRR, 2025)

Convergence Laws for Extensions of First-Order Logic with Averaging. - Sam Adam-Day; Michael Benedikt; Alberto Larrauri (CoRR, 2025)