Storage of spatially correlated patterns in autoassociative memoriesMONASSON, R.Journal de physique. I. 1993, Vol 3, Num 5, pp 1141-1152, issn 1155-4304Article

Diffusion, localization and dispersion relations on small-world latticesMONASSON, R.The European physical journal. B, Condensed matter physics. 1999, Vol 12, Num 4, pp 555-567, issn 1434-6028Article

Properties of neural networks storing spatially correlated patternsMONASSON, R.Journal of physics. A, mathematical and general. 1992, Vol 25, Num 13, pp 3701-3720, issn 0305-4470Article

On the capacity of neural networks with binary weightsKOCHER, I; MONASSON, R.Journal of physics. A, mathematical and general. 1992, Vol 25, Num 2, pp 367-380, issn 0305-4470Article

Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithmsCOCCO, S; MONASSON, R.The European physical journal. B, Condensed matter physics. 2001, Vol 22, Num 4, pp 505-531, issn 1434-6028Article

Domains of solutions and replica symmetry breaking in multilayer neural networksMONASSON, R; O'KANE, D.Europhysics letters (Print). 1994, Vol 27, Num 2, pp 85-90, issn 0295-5075Article

Criticality and universality in the unit-propagation search ruleDEROULERS, C; MONASSON, R.The European physical journal. B, Condensed matter physics. 2006, Vol 49, Num 3, pp 339-369, issn 1434-6028, 31 p.Article

Au seuil de la complexité calculatoire = At the threshold of the computing complexityCOCCO, S; DUBOIS, O; MANDLER, J et al.Pour la science. 2002, Num 295, pp 52-60, issn 0153-4092Article

Slow nucleic acid unzipping kinetics from sequence-defined barriersCOCCO, S; MARKO, J. F; MONASSON, R et al.The European physical journal. E, Soft matter (Print). 2003, Vol 10, Num 2, pp 153-161, issn 1292-8941, 9 p.Article

Symmetry breaking in non-monotonic neural networksBOFFETTA, G; MONASSON, R; ZECCHINA, R et al.Journal of physics. A, mathematical and general. 1993, Vol 26, Num 12, pp L507-L513, issn 0305-4470Article

Phase transitions in combinatorial problemsDUBOIS, O; MONASSON, R; SELMAN, B et al.Theoretical computer science. 2001, Vol 265, Num 1-2, issn 0304-3975, 309 p.Serial Issue

Upper bounds on the satisfiability thresholdDUBOIS, Olivier.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 187-197, issn 0304-3975Article

Lower bounds for random 3-SAT via differential equationsACHLIOPTAS, Dimitris.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 159-185, issn 0304-3975Article

Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphsHARTMANN, Alexander K; WEIGT, Martin.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 199-225, issn 0304-3975Article

Complexity of learning in artificial neural networksENGEL, Andreas.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 285-306, issn 0304-3975Article

A physicist's approach to number partitioningMERTENS, Stephan.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 79-108, issn 0304-3975Article

Constructing an asymptotic phase transition in random binary constraint satisfaction problemsSMITH, Barbara M.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 265-283, issn 0304-3975Article

Rigorous results for mean field models for spin glassesTALAGRAND, Michel.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 69-77, issn 0304-3975Article

Results related to threshold phenomena research in satisfiability : lower boundsFRANCO, John.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 147-157, issn 0304-3975Article

Force-extension behavior of folding polymersCOCCO, S; MARKO, J. F; MONASSON, R et al.The European physical journal. E, Soft matter (Print). 2003, Vol 10, Num 3, pp 249-263, issn 1292-8941, 15 p.Article

Statistical mechanics methods and phase transitions in optimization problemsMARTIN, Olivier C; MONASSON, Rémi; ZECCHINA, Riccardo et al.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 3-67, issn 0304-3975Article

Determining computational complexity from characteristic 'phase transitions'MONASSON, R; ZECCHINA, R; KIRKPATRICK, S et al.Nature (London). 1999, Vol 400, Num 6740, pp 133-137, issn 0028-0836Article

Rigorous results for random (2 + p)-SATACHLIOPTAS, Dimitris; KIROUSIS, Lefteris M; KRANAKIS, Evangelos et al.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 109-129, issn 0304-3975Article

Frozen development in graph coloringCULBERSON, Joseph; GENT, Ian.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 227-264, issn 0304-3975Article

Random 2-SAT: results and problemsFERNANDEZ DE LA VEGA, W.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 131-146, issn 0304-3975Article