Search the dblp DataBase
Andrea Montanari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Andrea Montanari, Riccardo Zecchina
Boosting search by rare events [Citation Graph (0, 0)][DBLP]
CoRR, 2001, v:0, n:, pp:- [Journal] - Andrea Montanari, Giorgio Parisi, Federico Ricci-Tersenghi
Instability of one-step replica-symmetry-broken phase in satisfiability problems [Citation Graph (0, 0)][DBLP]
CoRR, 2003, v:0, n:, pp:- [Journal] - Simona Cocco, Rémi Monasson, Andrea Montanari, Guilhem Semerjian
Approximate analysis of search algorithms with "physical" methods [Citation Graph (0, 0)][DBLP]
CoRR, 2003, v:0, n:, pp:- [Journal] - Abdelaziz Amraoui, Andrea Montanari, Thomas J. Richardson, Rüdiger L. Urbanke
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal] - Andrea Montanari
Tight bounds for LDPC and LDGM codes under MAP decoding [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal] - Abdelaziz Amraoui, Andrea Montanari, Thomas J. Richardson, Rüdiger L. Urbanke
Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal] - Cyril Measson, Andrea Montanari, Thomas J. Richardson, Rüdiger L. Urbanke
Life Above Threshold: From List Decoding to Area Theorem and MSE [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal] - Andrea Montanari
Tight Bounds for LDPC and LDGM Codes Under MAP Decoding. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3221-3246 [Journal] - Andrea Montanari, Devavrat Shah
Counting good truth assignments of random k-SAT formulae. [Citation Graph (0, 0)][DBLP]
SODA, 2007, pp:1255-1264 [Conf] - Andrea Montanari, Rüdiger L. Urbanke
Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal] - Florent Krzakala, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, Lenka Zdeborová
Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - Andrea Montanari, David Tse
Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula) [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - Abdelaziz Amraoui, Andrea Montanari, Ruediger Urbanke
How to Find Good Finite-Length Codes: From Art Towards Science [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - Andrea Montanari, Devavrat Shah
Counting good truth assignments of random k-SAT formulae [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - Andrea Montanari
Estimating Random Variables from Random Sparse Observations [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal] - Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian
Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal] - Yi Lu, Cyril Measson, Andrea Montanari
TP Decoding [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal] - Yi Lu, Andrea Montanari, Balaji Prabhakar
Detailed Network Measurements Using Sparse Graph Counters: The Theory [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Statistical static timing analysis using Markov chain Monte Carlo. [Citation Graph (, )][DBLP]
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources. [Citation Graph (, )][DBLP]
Reconstruction for Models on Random Graphs. [Citation Graph (, )][DBLP]
Convergence to Equilibrium in Local Interaction Games. [Citation Graph (, )][DBLP]
Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP]
Counter braids: a novel counter architecture for per-flow measurement. [Citation Graph (, )][DBLP]
Generating random graphs with large girth. [Citation Graph (, )][DBLP]
Message passing algorithms: a success looking for theoreticians. [Citation Graph (, )][DBLP]
Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding [Citation Graph (, )][DBLP]
Belief Propagation Based Multi--User Detection [Citation Graph (, )][DBLP]
Why We Can Not Surpass Capacity: The Matching Condition [Citation Graph (, )][DBLP]
The Generalized Area Theorem and Some of its Consequences [Citation Graph (, )][DBLP]
Coding for Network Coding [Citation Graph (, )][DBLP]
Clusters of solutions and replica symmetry breaking in random k-satisfiability [Citation Graph (, )][DBLP]
Generating Random Graphs with Large Girth [Citation Graph (, )][DBLP]
Convergence to Equilibrium in Local Interaction Games and Ising Models [Citation Graph (, )][DBLP]
Learning Low Rank Matrices from O(n) Entries [Citation Graph (, )][DBLP]
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources [Citation Graph (, )][DBLP]
Matrix Completion from a Few Entries [Citation Graph (, )][DBLP]
Reconstruction and Clustering in Random Constraint Satisfaction Problems [Citation Graph (, )][DBLP]
Matrix Completion from Noisy Entries [Citation Graph (, )][DBLP]
Message Passing Algorithms for Compressed Sensing [Citation Graph (, )][DBLP]
Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison [Citation Graph (, )][DBLP]
A Natural Dynamics for Bargaining on Exchange Networks [Citation Graph (, )][DBLP]
Message Passing Algorithms for Compressed Sensing: I. Motivation and Construction [Citation Graph (, )][DBLP]
Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation [Citation Graph (, )][DBLP]
Tight Thresholds for Cuckoo Hashing via XORSAT [Citation Graph (, )][DBLP]
On the deletion channel with small deletion probability [Citation Graph (, )][DBLP]
The dynamics of message passing on dense graphs, with applications to compressed sensing [Citation Graph (, )][DBLP]
Applications of Lindeberg Principle in Communications and Statistical Learning [Citation Graph (, )][DBLP]
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks [Citation Graph (, )][DBLP]
The Noise-Sensitivity Phase Transition in Compressed Sensing [Citation Graph (, )][DBLP]
On the concentration of the number of solutions of random satisfiability formulas [Citation Graph (, )][DBLP]
The LASSO risk for gaussian matrices [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.304secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002