| 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 | 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 | 2023-10-17 | Paper |
| Metastability of the Potts ferromagnet on random regular graphs | 2023-06-23 | Paper |
| Optimal group testing | 2023-03-30 | Paper |
| The $k$-XORSAT threshold revisited | 2023-01-23 | Paper |
| Lower bounds on the chromatic number of random graphs | 2023-01-23 | Paper |
| Belief propagation on the random \(k\)-SAT model | 2022-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091194 | 2022-07-21 | Paper |
| The Ising Antiferromagnet and Max Cut on Random Regular Graphs | 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 | 2021-06-15 | Paper |
| The Cut Metric for Probability Distributions | 2021-06-10 | Paper |
| The rank of sparse random matrices | 2021-02-02 | Paper |
| Warning Propagation on random graphs | 2021-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146650 | 2021-01-26 | Paper |
| Information-Theoretic and Algorithmic Thresholds for Group Testing | 2020-12-04 | Paper |
| The satisfiability threshold for random linear equations | 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 | 2019-11-26 | Paper |
| Analyzing Walksat on Random Formulas | 2019-09-17 | Paper |
| Hypergraph coloring up to condensation | 2019-08-14 | Paper |
| Core forging and local limit theorems for the \(k\)-core of random graphs | 2019-07-17 | Paper |
| The condensation transition in random hypergraph 2-coloring | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633827 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633854 | 2019-05-06 | Paper |
| Bethe states of random factor graphs | 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 | 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 | 2018-08-02 | Paper |
| The Number of Satisfying Assignments of Random Regulark-SAT Formulas | 2018-07-24 | Paper |
| Local convergence of random graph colorings | 2018-07-23 | Paper |
| Information-theoretic thresholds from the cavity method | 2018-07-05 | Paper |
| Belief propagation on replica symmetric random factor graph models | 2018-06-28 | Paper |
| Charting the replica symmetric phase | 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? | 2017-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368899 | 2017-10-11 | Paper |
| Planting Colourings Silently | 2017-10-10 | Paper |
| Contagious Sets in Expanders | 2017-10-05 | Paper |
| ‘The Asymptotic Number of Connected d-Uniform Hypergraphs’ — CORRIGENDUM | 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 | 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 | 2017-08-17 | Paper |
| Walksat Stalls Well Below Satisfiability | 2017-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969638 | 2017-03-22 | Paper |
| Harnessing the Bethe free energy | 2017-01-05 | Paper |
| On the Potts antiferromagnet on random graphs | 2016-12-06 | Paper |
| How does the core sit inside the mantle? | 2016-10-14 | Paper |
| A positive temperature phase transition in random hypergraph 2-coloring | 2016-08-23 | Paper |
| Constraint satisfaction: random regular k-SAT | 2016-07-29 | Paper |
| Phase Transitions in Discrete Structures | 2016-05-20 | Paper |
| The condensation phase transition in random graph coloring | 2016-02-23 | Paper |
| The asymptotic \(k\)-SAT threshold | 2015-12-23 | Paper |
| On the chromatic number of random regular graphs | 2015-12-11 | Paper |
| On independent sets in random graphs | 2015-11-13 | Paper |
| The asymptotic k-SAT threshold | 2015-06-26 | Paper |
| Random walks, random fields, and disordered systems | 2015-06-10 | Paper |
| Analyzing Walksat on random formulas | 2014-11-14 | Paper |
| A spectral heuristic for bisecting random graphs | 2014-10-13 | Paper |
| Upper-bounding the \(k\)-colorability threshold by counting covers | 2014-08-14 | Paper |
| Going after the k-SAT threshold | 2014-08-07 | Paper |
| The Asymptotic Number of Connectedd-Uniform Hypergraphs | 2014-05-28 | Paper |
| Local Limit Theorems for the Giant Component of Random Hypergraphs | 2014-05-28 | Paper |
| Catching the k-NAESAT threshold | 2014-05-13 | Paper |
| Separating populations with wide data: a spectral analysis | 2013-05-27 | Paper |
| The Decimation Process in Random $k$-SAT | 2013-04-09 | Paper |
| Chasing the k-colorability threshold | 2013-04-03 | Paper |
| Propagation connectivity of random hypergraphs | 2012-06-12 | Paper |
| The Decimation Process in Random k-SAT | 2011-07-06 | Paper |
| On the solution‐space geometry of random constraint satisfaction problems | 2011-05-11 | Paper |
| A Better Algorithm for Random k-SAT | 2011-04-04 | Paper |
| Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions | 2011-01-17 | Paper |
| An Efficient Sparse Regularity Concept | 2010-12-03 | Paper |
| Finding Planted Partitions in Random Graphs with General Degree Distributions | 2010-12-03 | Paper |
| The order of the giant component of random hypergraphs | 2010-11-10 | Paper |
| Propagation Connectivity of Random Hypergraphs | 2010-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576756 | 2010-08-02 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Why almost all \(k\)-colorable graphs are easy to color | 2010-05-05 | Paper |
| A Spectral Approach to Analysing Belief Propagation for 3-Colouring | 2010-04-23 | Paper |
| Graph Partitioning via Adaptive Spectral Techniques | 2010-04-23 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| The spectral gap of random graphs with given expected degrees | 2010-03-26 | Paper |
| An improved algorithm for approximating the chromatic number of \(G_{n,p}\) | 2010-01-29 | Paper |
| The evolution of the min-min random graph process | 2009-12-10 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A Better Algorithm for Random k-SAT | 2009-07-14 | Paper |
| Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\) | 2009-04-07 | Paper |
| The Spectral Gap of Random Graphs with Given Expected Degrees | 2009-03-12 | Paper |
| An Adaptive Spectral Heuristic for Partitioning Random Graphs | 2009-03-12 | Paper |
| Local Limit Theorems for the Giant Component of Random Hypergraphs | 2009-02-17 | Paper |
| On the chromatic number of random graphs | 2008-10-07 | Paper |
| Separating Populations with Wide Data: A Spectral Analysis | 2008-05-27 | Paper |
| Algorithmic barriers from phase transitions | 2008-03-14 | Paper |
| Colouring Semirandom Graphs | 2008-01-18 | Paper |
| Counting connected graphs and hypergraphs via the probabilistic method | 2008-01-08 | Paper |
| On the Chromatic Number of Random Graphs | 2007-11-28 | Paper |
| Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions | 2007-11-28 | Paper |
| On the Laplacian Eigenvalues of Gn,p | 2007-11-22 | Paper |
| Why Almost All k-Colorable Graphs Are Easy | 2007-09-03 | Paper |
| A hard dial-a-ride problem that is easy on average | 2007-05-15 | Paper |
| Solving NP-hard semirandom graph problems in polynomial expected time | 2007-05-14 | Paper |
| Strong Refutation Heuristics for Random k-SAT | 2007-03-20 | Paper |
| A spectral heuristic for bisecting random graphs | 2007-02-07 | Paper |
| A heuristic for the Stacker Crane Problem on trees which is almost surely exact | 2006-12-07 | Paper |
| Finding Large Independent Sets in Polynomial Expected Time | 2006-12-05 | Paper |
| MAX k‐CUT and approximating the chromatic number of random graphs | 2006-06-06 | Paper |
| The Lovász Number of Random Graphs | 2005-10-18 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT | 2005-02-09 | Paper |
| Exact and approximative algorithms for coloring G(n,p) | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461953 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449176 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440434 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418675 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418677 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708570 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4538941 | 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 |
