The following pages link to Amin Coja-Oghlan (Q248239):
Displayed 50 items.
- A positive temperature phase transition in random hypergraph 2-coloring (Q303945) (← links)
- How does the core sit inside the mantle? (Q322305) (← links)
- Upper-bounding the \(k\)-colorability threshold by counting covers (Q396853) (← links)
- Propagation connectivity of random hypergraphs (Q426773) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Local convergence of random graph colorings (Q722328) (← links)
- On the Potts antiferromagnet on random graphs (Q727170) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- On the chromatic number of random regular graphs (Q896008) (← links)
- The asymptotic \(k\)-SAT threshold (Q900872) (← links)
- On the chromatic number of random graphs (Q947725) (← links)
- Why almost all \(k\)-colorable graphs are easy to color (Q968270) (← links)
- Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\) (Q1010652) (← links)
- The evolution of the min-min random graph process (Q1043986) (← links)
- Phase transitions in discrete structures (Q1620869) (← links)
- Belief propagation on replica symmetric random factor graph models (Q1645020) (← links)
- Information-theoretic thresholds from the cavity method (Q1649349) (← links)
- Bethe states of random factor graphs (Q1733816) (← links)
- Charting the replica symmetric phase (Q1749356) (← links)
- Separating populations with wide data: a spectral analysis (Q1951968) (← links)
- The satisfiability threshold for random linear equations (Q2003764) (← links)
- Spin systems on Bethe lattices (Q2008960) (← links)
- Belief propagation on the random \(k\)-SAT model (Q2090606) (← links)
- Core forging and local limit theorems for the \(k\)-core of random graphs (Q2312608) (← links)
- Random walks, random fields, and disordered systems (Q2348137) (← links)
- The spectral gap of random graphs with given expected degrees (Q2380304) (← links)
- Limits of discrete distributions and Gibbs measures on random graphs (Q2403690) (← links)
- Lower bounds on the chromatic number of random graphs (Q2678448) (← links)
- Phase Transitions in Discrete Structures (Q2808189) (← links)
- (Q2921750) (← links)
- Analyzing Walksat on Random Formulas (Q2929704) (← links)
- Harnessing the Bethe free energy (Q2953696) (← links)
- (Q2969638) (← links)
- Constraint satisfaction: random regular <i>k</i>-SAT (Q2990202) (← links)
- The Decimation Process in Random k-SAT (Q3012815) (← links)
- The order of the giant component of random hypergraphs (Q3055882) (← links)
- Finding Planted Partitions in Random Graphs with General Degree Distributions (Q3058526) (← links)
- An Efficient Sparse Regularity Concept (Q3058542) (← links)
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (Q3068635) (← links)
- The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas (Q3177360) (← links)
- Belief Propagation Guided Decimation Fails on Random Formulas (Q3177876) (← links)
- A heuristic for the Stacker Crane Problem on trees which is almost surely exact (Q3410947) (← links)
- Finding Large Independent Sets in Polynomial Expected Time (Q3412105) (← links)
- A spectral heuristic for bisecting random graphs (Q3419599) (← links)
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- Solving NP-hard semirandom graph problems in polynomial expected time (Q3437092) (← links)
- On independent sets in random graphs (Q3452727) (← links)
- A Spectral Approach to Analysing Belief Propagation for 3-Colouring (Q3557516) (← links)
- Graph Partitioning via Adaptive Spectral Techniques (Q3557535) (← links)