#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2001

2018

- This year (3)
- Last 5 years (6)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Florent Krzakala, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, Lenka ZdeborovÃ¡
- Proceedings of the National Academy of Sciencesâ€¦
- 2007

An instance of a random constraint satisfaction problem defines a random subset (the set of solutions) of a large product space chiN (the set of assignments). We consider two prototypical problemâ€¦ (More)

Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially toâ€¦ (More)

- Federico Ricci-Tersenghi, Guilhem Semerjian
- ArXiv
- 2009

We introduce a version of the cavity method for diluted meanfield spin models that allows the computation of thermodynamic quantities similar to the Franzâ€“Parisi quenched potential in sparse randomâ€¦ (More)

We study the set of solutions of random k-satisfiability formulas through the cavity method. It is known that, for an interval of the clauseto-variables ratio, this decomposes into an exponentialâ€¦ (More)

- Guilhem Semerjian
- ArXiv
- 2007

The set of solutions of random constraint satisfaction problems (zero energy groundstates of mean-field diluted spin glasses) undergoes several structural phase transitions as the amount ofâ€¦ (More)

Glassy systems are characterized by an extremely sluggish dynamics without any simple sign of long range order. It is a debated question whether a correct description of such phenomenon requires theâ€¦ (More)

â€“ We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparseâ€¦ (More)

- Simona Cocco, RÃ©mi Monasson, Andrea Montanari, Guilhem Semerjian
- ArXiv
- 2003

An overview of some methods of statistical physics applied to the analysis of algorithms for optimization problems (satisfiability of Boolean constraints, vertex cover of graphs, decoding, ...) withâ€¦ (More)

â€¢PUBLICATION TRACK More than hundred articles in peer-reviewed international journals and conference proceedings with 5300+ citations on Google Scholar (GS). My h-index is 40 as of 31/9/2018, and myâ€¦ (More)

- Alfredo Braunstein, Luca Dall'Asta, Guilhem Semerjian, Lenka ZdeborovÃ¡
- Proceedings of the National Academy of Sciencesâ€¦
- 2016

We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For aâ€¦ (More)