Marc Mézard - Citegraph

Author Info

Name	Affiliation	Papers
MARC MÉZARD	Univ Paris Sud, CNRS, UMR8626, LPTMS, F-91405 Orsay, France	28
Collaborators	Citations	PageRank
36	590	39.09
Referers	Referees	References
792	236	210

Search Limit

100792

Publications (28 rows)

Collaborators (36 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Learning curves of generic features maps for realistic datasets with a teacher-student model.	0	0.34	2021
Generalisation error in learning with random features and the hidden manifold model*	0	0.34	2020
Dynamic message-passing equations for models with unidirectional dynamics.	4	0.41	2014
Reweighted Belief Propagation and Quiet Planting for Random K-SAT.	7	0.98	2014
Phase transitions and sample complexity in Bayes-optimal matrix factorization.	19	0.80	2014
Phase diagram and approximate message passing for blind calibration and dictionary learning	18	0.91	2013
Non-adaptive pooling strategies for detection of rare faulty items	4	0.43	2013
Inferring the origin of an epidemic with a dynamic message-passing algorithm.	53	1.87	2013
Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices	94	3.60	2012
Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction	9	0.57	2012
Belief-Propagation Reconstruction For Discrete Tomography	4	0.46	2012
Statistical physics-based reconstruction in compressed sensing	95	4.04	2011
Special Section on Constraint Satisfaction Problems and Message Passing Algorithms.	0	0.34	2011
Correlation-Based Decimation In Constraint Satisfaction Problems	1	0.40	2009
Decimation flows in constraint satisfaction problems	0	0.34	2009
Hard constraint satisfaction problems	0	0.34	2008
Constraint satisfaction problems with isolated solutions are hard	14	1.23	2008
The number of matchings in random graphs	27	2.22	2006
Geometrical organization of solutions to random linear Boolean equations	7	0.72	2006
Landscape Of Solutions In Constraint Satisfaction Problems	11	1.14	2005
Pairs of SAT-assignments in random Boolean formulæ	13	0.84	2005
Clustering Of Solutions In The Random Satisfiability Problem	53	3.11	2005
The theoretical capacity of the Parity Source Coder	11	0.83	2005
Threshold values of random K-SAT from the cavity method	57	4.70	2003
Alternative solutions to diluted p-spin models and XORSAT problems	61	4.20	2002
Constraint Satisfaction by Survey Propagation	22	2.96	2002
On The Mean Field Theory of Random Heteropolymers	0	0.34	1992
Basins of attraction in a perceptron-like neural network	6	0.66	1988