| Publication | Date of Publication | Type |
|---|
The full rank condition for sparse random matrices
| 2025-01-14 | Paper |
Bad local minima exist in the stochastic block model
Journal of Statistical Physics | 2024-12-06 | Paper |
The sparse parity matrix
| 2024-07-19 | Paper |
Metastability of the Potts ferromagnet on random regular graphs
| 2024-06-24 | Paper |
The rank of sparse random matrices
Random Structures & Algorithms | 2023-10-17 | Paper |
Metastability of the Potts ferromagnet on random regular graphs
Communications in Mathematical Physics | 2023-06-23 | Paper |
Optimal group testing
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
The $k$-XORSAT threshold revisited
| 2023-01-23 | Paper |
Lower bounds on the chromatic number of random graphs
Combinatorica | 2023-01-23 | Paper |
Belief propagation on the random \(k\)-SAT model
The Annals of Applied Probability | 2022-10-31 | Paper |
Information-theoretic and algorithmic thresholds for group testing
| 2022-07-21 | Paper |
The Ising Antiferromagnet and Max Cut on Random Regular Graphs
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
The full rank condition for sparse random matrices
| 2021-12-28 | Paper |
Charting the replica symmetric phase
| 2021-07-28 | Paper |
The sparse parity matrix
| 2021-07-13 | Paper |
The replica symmetric phase of random constraint satisfaction problems
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
The cut metric for probability distributions
SIAM Journal on Discrete Mathematics | 2021-06-10 | Paper |
The rank of sparse random matrices
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Warning Propagation on random graphs
| 2021-02-01 | Paper |
scientific article; zbMATH DE number 7301529 (Why is no real title available?)
| 2021-01-26 | Paper |
Information-Theoretic and Algorithmic Thresholds for Group Testing
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
The satisfiability threshold for random linear equations
Combinatorica | 2020-10-02 | Paper |
The Ising antiferromagnet and max cut on random regular graphs
| 2020-09-22 | Paper |
Inference and mutual information on random factor graphs
| 2020-07-15 | Paper |
The random 2-SAT partition function
| 2020-02-10 | Paper |
Spin systems on Bethe lattices
Communications in Mathematical Physics | 2019-11-26 | Paper |
Analyzing Walksat on random formulas
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Hypergraph coloring up to condensation
Random Structures & Algorithms | 2019-08-14 | Paper |
Core forging and local limit theorems for the \(k\)-core of random graphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
The condensation transition in random hypergraph 2-coloring
| 2019-05-10 | Paper |
An efficient sparse regularity concept
| 2019-05-06 | Paper |
On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm
| 2019-05-06 | Paper |
Bethe states of random factor graphs
Communications in Mathematical Physics | 2019-03-21 | Paper |
Lower bounds on the chromatic number of random graphs
| 2018-12-23 | Paper |
The chromatic number of random graphs for most average degrees
IMRN. International Mathematics Research Notices | 2018-12-12 | Paper |
Phase transitions in discrete structures
| 2018-11-14 | Paper |
The rank of random matrices over finite fields
| 2018-10-17 | Paper |
Belief propagation guided decimation fails on random formulas
Journal of the ACM | 2018-08-02 | Paper |
The number of satisfying assignments of random regular \(k\)-SAT formulas
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
Local convergence of random graph colorings
Combinatorica | 2018-07-23 | Paper |
Information-theoretic thresholds from the cavity method
Advances in Mathematics | 2018-07-05 | Paper |
Belief propagation on replica symmetric random factor graph models
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) | 2018-06-28 | Paper |
Charting the replica symmetric phase
Communications in Mathematical Physics | 2018-05-16 | Paper |
The condensation phase transition in the regular $k$-SAT model
| 2018-04-19 | Paper |
Belief propagation on replica symmetric random factor graph models
| 2018-04-19 | Paper |
How does the core sit inside the mantle?
Random Structures & Algorithms | 2017-10-24 | Paper |
The minimum bisection in the planted bisection model
Theory of Computing | 2017-10-11 | Paper |
Planting colourings silently
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Contagious sets in expanders
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
On independent sets in random graphs
| 2017-09-29 | Paper |
On belief propagation guided decimation for random \(k\)-SAT
| 2017-09-29 | Paper |
Limits of discrete distributions and Gibbs measures on random graphs
European Journal of Combinatorics | 2017-09-11 | Paper |
The minimum bisection in the planted bisection model
| 2017-08-31 | Paper |
Harnessing the Bethe free energy
| 2017-08-31 | Paper |
Local convergence of random graph colorings
| 2017-08-31 | Paper |
Information-theoretic thresholds from the cavity method
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Walksat Stalls Well Below Satisfiability
SIAM Journal on Discrete Mathematics | 2017-06-14 | Paper |
The condensation phase transition in random graph coloring
| 2017-03-22 | Paper |
Harnessing the Bethe free energy
Random Structures & Algorithms | 2017-01-05 | Paper |
On the Potts antiferromagnet on random graphs
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
How does the core sit inside the mantle?
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
A positive temperature phase transition in random hypergraph 2-coloring
The Annals of Applied Probability | 2016-08-23 | Paper |
Constraint satisfaction: random regular \(k\)-SAT
Statistical Physics, Optimization, Inference, and Message-Passing Algorithms | 2016-07-29 | Paper |
Phase transitions in discrete structures
Lecture Notes in Mathematics | 2016-05-20 | Paper |
The condensation phase transition in random graph coloring
Communications in Mathematical Physics | 2016-02-23 | Paper |
The asymptotic \(k\)-SAT threshold
Advances in Mathematics | 2015-12-23 | Paper |
On the chromatic number of random regular graphs
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
On independent sets in random graphs
Random Structures & Algorithms | 2015-11-13 | Paper |
The asymptotic \(k\)-SAT threshold
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Random walks, random fields, and disordered systems
Lecture Notes in Mathematics | 2015-06-10 | Paper |
Analyzing Walksat on random formulas
SIAM Journal on Computing | 2014-11-14 | Paper |
A spectral heuristic for bisecting random graphs
| 2014-10-13 | Paper |
Upper-bounding the \(k\)-colorability threshold by counting covers
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Going after the \(k\)-SAT threshold
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The asymptotic number of connected \(d\)-uniform hypergraphs
Combinatorics, Probability and Computing | 2014-05-28 | Paper |
Local limit theorems for the giant component of random hypergraphs
Combinatorics, Probability and Computing | 2014-05-28 | Paper |
Catching the \(k\)-NAESAT threshold
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Separating populations with wide data: a spectral analysis
Electronic Journal of Statistics | 2013-05-27 | Paper |
The decimation process in random \(k\)-SAT
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Chasing the k-colorability threshold
| 2013-04-03 | Paper |
Propagation connectivity of random hypergraphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
The decimation process in random \(k\)-SAT
Automata, Languages and Programming | 2011-07-06 | Paper |
On the solution-space geometry of random constraint satisfaction problems
Random Structures & Algorithms | 2011-05-11 | Paper |
A better algorithm for random \(k\)-SAT
SIAM Journal on Computing | 2011-04-04 | Paper |
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
SIAM Journal on Computing | 2011-01-17 | Paper |
An efficient sparse regularity concept
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
The order of the giant component of random hypergraphs
Random Structures & Algorithms | 2010-11-10 | Paper |
Propagation connectivity of random hypergraphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Why almost all satisfiable k-CNF formulas are easy
| 2010-08-02 | Paper |
The Lovász number of random graphs
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Why almost all \(k\)-colorable graphs are easy to color
Theory of Computing Systems | 2010-05-05 | Paper |
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Certifying unsatisfiability of random \(2k\)-SAT formulas using approximation techniques.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
The spectral gap of random graphs with given expected degrees
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
Information Processing Letters | 2010-01-29 | Paper |
The evolution of the min-min random graph process
Discrete Mathematics | 2009-12-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
A Better Algorithm for Random k-SAT
Automata, Languages and Programming | 2009-07-14 | Paper |
Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
An Adaptive Spectral Heuristic for Partitioning Random Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
The Spectral Gap of Random Graphs with Given Expected Degrees
Automata, Languages and Programming | 2009-03-12 | Paper |
Local Limit Theorems for the Giant Component of Random Hypergraphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
On the chromatic number of random graphs
Journal of Combinatorial Theory. Series B | 2008-10-07 | Paper |
Separating Populations with Wide Data: A Spectral Analysis
Algorithms and Computation | 2008-05-27 | Paper |
Algorithmic barriers from phase transitions
| 2008-03-14 | Paper |
Colouring Semirandom Graphs
Combinatorics, Probability and Computing | 2008-01-18 | Paper |
Counting connected graphs and hypergraphs via the probabilistic method
Random Structures & Algorithms | 2008-01-08 | Paper |
On the Chromatic Number of Random Graphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Automata, Languages and Programming | 2007-11-28 | Paper |
On the Laplacian Eigenvalues of Gn,p
Combinatorics, Probability and Computing | 2007-11-22 | Paper |
Why Almost All k-Colorable Graphs Are Easy
STACS 2007 | 2007-09-03 | Paper |
A hard dial-a-ride problem that is easy on average
Journal of Scheduling | 2007-05-15 | Paper |
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms | 2007-05-14 | Paper |
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
A spectral heuristic for bisecting random graphs
Random Structures & Algorithms | 2007-02-07 | Paper |
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms | 2006-12-07 | Paper |
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing | 2006-12-05 | Paper |
MAX k‐CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms | 2006-06-06 | Paper |
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing | 2005-10-18 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
Theoretical Computer Science | 2005-02-09 | Paper |
Exact and approximative algorithms for coloring G(n,p)
Random Structures & Algorithms | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2064462 (Why is no real title available?)
| 2004-05-18 | Paper |
scientific article; zbMATH DE number 2038711 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 2019631 (Why is no real title available?)
| 2003-12-17 | Paper |
scientific article; zbMATH DE number 1962838 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1962840 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1929938 (Why is no real title available?)
| 2003-06-18 | Paper |
scientific article; zbMATH DE number 1762860 (Why is no real title available?)
| 2002-07-03 | Paper |
Noisy group testing via spatial coupling
| N/A | Paper |
The number of random 2-SAT solutions is asymptotically log-normal
| N/A | Paper |
