default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Larrauri
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Alberto Larrauri
, Stanislav Zivný:
Solving Promise Equations over Monoids and Groups. ACM Trans. Comput. Log. 26(1): 3:1-3:24 (2025)- [c3]Benedikt Maderbacher, Felix Windisch, Alberto Larrauri, Roderick Bloem:
Synthesis of Controllers for Continuous Blackbox Systems. VMCAI (2) 2025: 137-159 - [i9]Alberto Larrauri, Antoine Mottet, Stanislav Zivný:
Equations over Finite Monoids with Infinite Promises. CoRR abs/2502.06762 (2025) - [i8]Alberto Larrauri:
Ineffectiveness for Search and Undecidability of PCSP Meta-Problems. CoRR abs/2504.04639 (2025) - [i7]Sam Adam-Day, Michael Benedikt, Alberto Larrauri:
Convergence Laws for Extensions of First-Order Logic with Averaging. CoRR abs/2504.14270 (2025) - 2024
- [c2]Alberto Larrauri, Stanislav Zivný:
Solving Promise Equations over Monoids and Groups. ICALP 2024: 146:1-146:18 - [i6]Alberto Larrauri, Stanislav Zivný:
Solving promise equations over monoids and groups. CoRR abs/2402.08434 (2024) - [i5]Alberto Larrauri, Guillem Perarnau:
First Order Logic of Sparse Graphs with Given Degree Sequences. CoRR abs/2405.14836 (2024) - [i4]Silvia Butti, Alberto Larrauri, Stanislav Zivný:
Optimal Inapproximability of Promise Equations over Finite Groups. CoRR abs/2411.01630 (2024) - 2022
- [j2]Lázaro Alberto Larrauri, Tobias Müller, Marc Noy:
Limiting probabilities of first order properties of random sparse graphs and hypergraphs. Random Struct. Algorithms 60(3): 506-526 (2022) - [c1]Roderick Bloem, Alberto Larrauri, Roland Lengfeldner, Cristinel Mateis, Dejan Nickovic, Björn Ziegler:
Industry Paper: Surrogate Models for Testing Analog Designs under Limited Budget - a Bandgap Case Study. CODES+ISSS 2022: 21-24 - [i3]Alberto Larrauri, Roderick Bloem:
Conformance Testing of Mealy Machines Under Input Restrictions. CoRR abs/2206.07441 (2022) - 2021
- [j1]Lázaro Alberto Larrauri:
Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas. J. Log. Comput. 31(2): 444-472 (2021) - [i2]Lázaro Alberto Larrauri, Roderick Bloem:
Minimization and Synthesis of the Tail inSequential Compositions of Mealy Machines. CoRR abs/2105.10292 (2021) - 2020
- [i1]Lázaro Alberto Larrauri:
Probabilities of first order sentences on sparse random relational structures: An application to definability on random CNF formulas. CoRR abs/2006.06099 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-24 01:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
