The following pages link to Amin Coja-Oghlan (Q248239):
Displayed 27 items.
- Counting connected graphs and hypergraphs via the probabilistic method (Q5433264) (← links)
- Colouring Semirandom Graphs (Q5437231) (← links)
- Automata, Languages and Programming (Q5466478) (← links)
- MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (Q5471049) (← links)
- Going after the k-SAT threshold (Q5495841) (← links)
- The Lovász Number of Random Graphs (Q5696358) (← links)
- The condensation transition in random hypergraph 2-coloring (Q5743395) (← links)
- The Ising Antiferromagnet and Max Cut on Random Regular Graphs (Q5864219) (← links)
- Optimal group testing (Q5886113) (← links)
- On the solution‐space geometry of random constraint satisfaction problems (Q5892482) (← links)
- Fundamentals of Computation Theory (Q5900782) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900936) (← links)
- Propagation Connectivity of Random Hypergraphs (Q5901181) (← links)
- The condensation phase transition in random graph coloring (Q5963760) (← links)
- The rank of sparse random matrices (Q6077051) (← links)
- Metastability of the Potts ferromagnet on random regular graphs (Q6160255) (← links)
- Algorithmic barriers from phase transitions (Q6208764) (← links)
- Chasing the k-colorability threshold (Q6240874) (← links)
- The rank of random matrices over finite fields (Q6308380) (← links)
- Lower bounds on the chromatic number of random graphs (Q6311568) (← links)
- The random 2-SAT partition function (Q6334473) (← links)
- Inference and mutual information on random factor graphs (Q6345129) (← links)
- The Ising antiferromagnet and max cut on random regular graphs (Q6349625) (← links)
- Warning Propagation on random graphs (Q6359575) (← links)
- The sparse parity matrix (Q6372687) (← links)
- The full rank condition for sparse random matrices (Q6386863) (← links)
- The $k$-XORSAT threshold revisited (Q6424083) (← links)