Get started
Author

Amin Coja‐Oghlan

Observed names: A. Coja-Oghlan, AMIN COJA-OGHLAN, Amin Coja-Oghlan, Amin Coja-oghlan, Coja-Oghlan, Amin, Coja-Oghlan, Amin 1975-
Observed institutions: Goethe University Frankfurt, Tokyo Institute of Technology, TU Dortmund University, Humboldt-Universität zu Berlin, University of Warwick, Carnegie Mellon University, University of Edinburgh
ORCID: 0000-0002-7350-1418
Observed ORCID: 0000-0002-7350-1418
OpenAlex ID: A5044991483
Algorithmic Barriers from Phase Transitions
2013 · Dimitris Achlioptas, Amin Coja-oghlan · 196
Graph Partitioning via Adaptive Spectral Techniques
2009 · AMIN COJA-OGHLAN · Combinatorics Probability Computing · 154
On the solution‐space geometry of random constraint satisfaction problems
2010 · Dimitris Achlioptas, Amin Coja‐Oghlan, et al. · Random Structures and Algorithms · 103
Information-theoretic thresholds from the cavity method
2018 · Amin Coja-Oghlan, Florent Krzakala, et al. · Advances in Mathematics · 89
PDF
A Better Algorithm for Random k -SAT
2010 · Amin Coja-Oghlan · SIAM Journal on Computing · 81
PDF
The asymptotic k-SAT threshold
2015 · Amin Coja-Oghlan, Konstantinos Panagiotou · Advances in Mathematics · 73
PDF
On the Laplacian Eigenvalues of Gn,p
2007 · AMIN COJA-OGHLAN · Combinatorics Probability Computing · 58
Upper-Bounding the $k$-Colorability Threshold by Counting Covers
2013 · Amin Coja-Oghlan · The Electronic Journal of Combinatorics · 53
PDF
On independent sets in random graphs
2014 · Amin Coja-Oghlan, Charilaos Efthymiou · Random Structures and Algorithms · 51
PDF
Chasing the K-Colorability Threshold
2013 · Amin Coja-Oghlan, Dan Vilenchik · Annual Symposium on Foundations of Computer Science · 51
PDF
The condensation transition in random hypergraph 2-coloring
2012 · Amin Coja-Oghlan, Lenka Zdeborová · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 46
PDF
Finding Planted Partitions in Random Graphs with General Degree Distributions
2009 · Amin Coja-Oghlan, André Lanka · SIAM Journal on Discrete Mathematics · 43
The asymptotic k-SAT threshold
2014 · Amin Coja-Oghlan · ACM Symposium on Theory of Computing (STOC) · 41
PDF
On the chromatic number of random graphs
2008 · Amin Coja-Oghlan, Konstantinos Panagiotou, et al. · Journal of Combinatorial Theory Series B · 40
Contagious Sets in Expanders
2014 · Amin Coja-Oghlan, Uriel Feige, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 38
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
2010 · Noga Alon, Amin Coja-Oghlan, et al. · SIAM Journal on Computing · 37
Charting the Replica Symmetric Phase
2018 · Amin Coja-Oghlan, Charilaos Efthymiou, et al. · Communications in Mathematical Physics · 35
PDF
Contagious sets in expanders
2015 · Amin Coja‐Oghlan, Uriel Feige, et al. · 31
An Efficient Sparse Regularity Concept
2010 · Amin Coja-Oghlan, Colin Cooper, et al. · SIAM Journal on Discrete Mathematics · 30
Information-theoretic thresholds from the cavity method
2017 · Amin Coja-Oghlan, Florent Krzakala, et al. · ACM SIGACT Symposium on Theory of Computing (STOC) · 29
On the chromatic number of random regular graphs
2015 · Amin Coja-Oghlan, Charilaos Efthymiou, et al. · Journal of Combinatorial Theory Series B · 28
Counting connected graphs and hypergraphs via the probabilistic method
2007 · Amin Coja‐Oghlan, Cristopher Moore, et al. · Random Structures and Algorithms · 27
Strong Refutation Heuristics for Random k -SAT
2006 · AMIN COJA-OGHLAN, ANDREAS GOERDT, et al. · Combinatorics Probability Computing · 27
Hypergraph coloring up to condensation
2018 · Peter Ayre, Amin Coja‐Oghlan, et al. · Random Structures and Algorithms · 26
PDF
On independent sets in random graphs
2011 · Amin Coja-Oghlan, Charilaos Efthymiou · 25
Works count: 192
Citation count: 2,414
H-index: 25
I10-index: 68
Year
Topic
Type