default search action
Fabrizio Altarelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [p2]Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
Connections to Statistical Physics. Handbook of Satisfiability 2021: 859-901
2010 – 2019
- 2015
- [i12]Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta, Caterina De Bacco, Silvio Franz:
The edge-disjoint path problem on random graphs by message-passing. CoRR abs/1503.00540 (2015) - 2014
- [i11]Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta:
Statics and dynamics of selfish interactions in distributed service systems. CoRR abs/1409.2013 (2014) - 2013
- [c1]Fabrizio Altarelli, Alfredo Braunstein, Carla-Fabiana Chiasserini, Luca Dall'Asta, Paolo Giaccone, Emilio Leonardi, Riccardo Zecchina:
Stochastic optimization of service provision with selfish users. ICC Workshops 2013: 1415-1419 - [i10]Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta, Alejandro Lage-Castellanos, Riccardo Zecchina:
Bayesian inference of epidemics on networks via Belief Propagation. CoRR abs/1307.6786 (2013) - [i9]Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta, Joseph R. Wakeling, Riccardo Zecchina:
Containing epidemic outbreaks by message-passing techniques. CoRR abs/1309.2805 (2013) - [i8]Fabrizio Altarelli, Alfredo Braunstein, Carla-Fabiana Chiasserini, Luca Dall'Asta, Paolo Giaccone, Emilio Leonardi, Riccardo Zecchina:
Stochastic Optimization of Service Provision with Selfish Users. CoRR abs/1309.3984 (2013) - 2012
- [i7]Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta, Riccardo Zecchina:
The Spread Optimization Problem. CoRR abs/1203.1426 (2012) - 2011
- [i6]Fabrizio Altarelli, Alfredo Braunstein, Abolfazl Ramezanpour, Riccardo Zecchina:
Stochastic optimization by message passing. CoRR abs/1108.6160 (2011)
2000 – 2009
- 2009
- [p1]Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
Connections to Statistical Physics. Handbook of Satisfiability 2009: 569-611 - [i5]Fabrizio Altarelli, Alfredo Braunstein, John Realpe-Gomez, Riccardo Zecchina:
Statistical mechanics of budget-constrained auctions. CoRR abs/0903.2429 (2009) - 2008
- [i4]Fabrizio Altarelli:
Theoretical analysis of optimization problems - Some properties of random k-SAT and k-XORSAT. CoRR abs/0801.2858 (2008) - [i3]Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
A review of the Statistical Mechanics approach to Random Optimization Problems. CoRR abs/0802.1829 (2008) - 2007
- [i2]Fabrizio Altarelli, Rémi Monasson, Francesco Zamponi:
Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions. CoRR abs/0709.0367 (2007) - 2006
- [i1]Fabrizio Altarelli, Rémi Monasson, Francesco Zamponi:
Can rare SAT formulas be easily recognized? On the efficiency of message passing algorithms for K-SAT at large clause-to-variable ratios. CoRR abs/cs/0609101 (2006)
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 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint