Alberto Larrauri

Orcid: 0000-0002-5935-4917

Affiliations:
  • University of Oxford, UK


According to our database1, Alberto Larrauri authored at least 13 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Convergence Laws for Extensions of First-Order Logic with Averaging.
CoRR, April, 2025

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems.
CoRR, April, 2025

Equations over Finite Monoids with Infinite Promises.
CoRR, February, 2025

Solving Promise Equations over Monoids and Groups.
ACM Trans. Comput. Log., January, 2025

Synthesis of Controllers for Continuous Blackbox Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2025

Optimal Inapproximability of Promise Equations over Finite Groups.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Synthesis of Controllers for Continuous Blackbox Systems (artifact).
Dataset, October, 2024

First Order Logic of Sparse Graphs with Given Degree Sequences.
CoRR, 2024

2022
Limiting probabilities of first order properties of random sparse graphs and hypergraphs.
Random Struct. Algorithms, 2022

Conformance Testing of Mealy Machines Under Input Restrictions.
CoRR, 2022

Industry Paper: Surrogate Models for Testing Analog Designs under Limited Budget - a Bandgap Case Study.
Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis, 2022

2021
Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas.
J. Log. Comput., 2021

Minimization and Synthesis of the Tail inSequential Compositions of Mealy Machines.
CoRR, 2021


  Loading...