The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Montanari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrea Montanari, Riccardo Zecchina
    Boosting search by rare events [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  2. 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]
  3. 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]
  4. 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]
  5. Andrea Montanari
    Tight bounds for LDPC and LDGM codes under MAP decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  6. 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]
  7. 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]
  8. 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]
  9. Andrea Montanari, Devavrat Shah
    Counting good truth assignments of random k-SAT formulae. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1255-1264 [Conf]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. Andrea Montanari
    Estimating Random Variables from Random Sparse Observations [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  16. 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]
  17. Yi Lu, Cyril Measson, Andrea Montanari
    TP Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  18. 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]

  19. Statistical static timing analysis using Markov chain Monte Carlo. [Citation Graph (, )][DBLP]


  20. An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources. [Citation Graph (, )][DBLP]


  21. Reconstruction for Models on Random Graphs. [Citation Graph (, )][DBLP]


  22. Convergence to Equilibrium in Local Interaction Games. [Citation Graph (, )][DBLP]


  23. Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP]


  24. Counter braids: a novel counter architecture for per-flow measurement. [Citation Graph (, )][DBLP]


  25. Generating random graphs with large girth. [Citation Graph (, )][DBLP]


  26. Message passing algorithms: a success looking for theoreticians. [Citation Graph (, )][DBLP]


  27. Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding [Citation Graph (, )][DBLP]


  28. Belief Propagation Based Multi--User Detection [Citation Graph (, )][DBLP]


  29. Why We Can Not Surpass Capacity: The Matching Condition [Citation Graph (, )][DBLP]


  30. The Generalized Area Theorem and Some of its Consequences [Citation Graph (, )][DBLP]


  31. Coding for Network Coding [Citation Graph (, )][DBLP]


  32. Clusters of solutions and replica symmetry breaking in random k-satisfiability [Citation Graph (, )][DBLP]


  33. Generating Random Graphs with Large Girth [Citation Graph (, )][DBLP]


  34. Convergence to Equilibrium in Local Interaction Games and Ising Models [Citation Graph (, )][DBLP]


  35. Learning Low Rank Matrices from O(n) Entries [Citation Graph (, )][DBLP]


  36. An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources [Citation Graph (, )][DBLP]


  37. Matrix Completion from a Few Entries [Citation Graph (, )][DBLP]


  38. Reconstruction and Clustering in Random Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  39. Matrix Completion from Noisy Entries [Citation Graph (, )][DBLP]


  40. Message Passing Algorithms for Compressed Sensing [Citation Graph (, )][DBLP]


  41. Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison [Citation Graph (, )][DBLP]


  42. A Natural Dynamics for Bargaining on Exchange Networks [Citation Graph (, )][DBLP]


  43. Message Passing Algorithms for Compressed Sensing: I. Motivation and Construction [Citation Graph (, )][DBLP]


  44. Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation [Citation Graph (, )][DBLP]


  45. Tight Thresholds for Cuckoo Hashing via XORSAT [Citation Graph (, )][DBLP]


  46. On the deletion channel with small deletion probability [Citation Graph (, )][DBLP]


  47. The dynamics of message passing on dense graphs, with applications to compressed sensing [Citation Graph (, )][DBLP]


  48. Applications of Lindeberg Principle in Communications and Statistical Learning [Citation Graph (, )][DBLP]


  49. Fast Convergence of Natural Bargaining Dynamics in Exchange Networks [Citation Graph (, )][DBLP]


  50. The Noise-Sensitivity Phase Transition in Compressed Sensing [Citation Graph (, )][DBLP]


  51. On the concentration of the number of solutions of random satisfiability formulas [Citation Graph (, )][DBLP]


  52. The LASSO risk for gaussian matrices [Citation Graph (, )][DBLP]


Search in 0.801secs, Finished in 0.803secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002