default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Zamponi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Brandon Livio Annesi, Enrico M. Malatesta, Francesco Zamponi:
Exact full-RSB SAT/UNSAT transition in infinitely wide two-layer neural networks. CoRR abs/2410.06717 (2024)- 2023
- [j2]Simone Ciarella
, Jeanne Trinquier, Martin Weigt, Francesco Zamponi:
Machine-learning-assisted Monte Carlo fails at sampling computationally hard problems. Mach. Learn. Sci. Technol. 4(1): 10501 (2023) - 2021
- [j1]Anna Paola Muntoni, Andrea Pagnani, Martin Weigt, Francesco Zamponi:
adabmDCA: adaptive Boltzmann machine learning for biological sequences. BMC Bioinform. 22(3): 528 (2021) - [p2]Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
Connections to Statistical Physics. Handbook of Satisfiability 2021: 859-901 - 2020
- [i10]Pierre Barrat-Charlaix, Anna Paola Muntoni, Kai Shimagaki, Martin Weigt, Francesco Zamponi:
Sparse generative modeling of protein-sequence families. CoRR abs/2011.11259 (2020)
2010 – 2019
- 2013
- [i9]Victor Bapst, Guilhem Semerjian, Francesco Zamponi:
The effect of quantum fluctuations on the coloring of random graphs. CoRR abs/1302.6861 (2013) - 2012
- [i8]Victor Bapst, Laura Foini, Florent Krzakala, Guilhem Semerjian, Francesco Zamponi:
The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective. CoRR abs/1210.0811 (2012) - 2010
- [i7]Francesco Zamponi:
Mean field theory of spin glasses. CoRR abs/1008.4844 (2010)
2000 – 2009
- 2009
- [p1]Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
Connections to Statistical Physics. Handbook of Satisfiability 2009: 569-611 - [i6]Thomas Jörg, Florent Krzakala, Guilhem Semerjian, Francesco Zamponi:
First-order transitions and the performance of quantum algorithms in random optimization problems. CoRR abs/0911.3438 (2009) - 2008
- [i5]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
- [i4]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
- [i3]Giorgio Parisi, Francesco Zamponi:
Amorphous packings of hard spheres in large space dimension. CoRR abs/cond-mat/0601573 (2006) - [i2]Giorgio Parisi, Francesco Zamponi:
On the high density behavior of Hamming codes with fixed minimum distance. CoRR abs/cond-mat/0602661 (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-12-01 01:11 CET 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:
