Follow
Amin Coja-Oghlan
Amin Coja-Oghlan
Verified email at tu-dortmund.de - Homepage
Title
Cited by
Cited by
Year
Algorithmic barriers from phase transitions
D Achlioptas, A Coja-Oghlan
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 793-802, 2008
3232008
Graph partitioning via adaptive spectral techniques
A Coja-Oghlan
Combinatorics, Probability and Computing 19 (2), 227-284, 2010
1902010
Information-theoretic thresholds from the cavity method
A Coja-Oghlan, F Krzakala, W Perkins, L Zdeborová
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
1392017
The asymptotic k-SAT threshold
A Coja-Oghlan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1392014
On the solution‐space geometry of random constraint satisfaction problems
D Achlioptas, A Coja‐Oghlan, F Ricci‐Tersenghi
Random Structures & Algorithms 38 (3), 251-268, 2011
1082011
On independent sets in random graphs
A Coja‐Oghlan, C Efthymiou
Random Structures & Algorithms 47 (3), 436-486, 2015
1032015
The condensation transition in random hypergraph 2-coloring
A Coja-Oghlan, L Zdeborová
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
932012
On the Laplacian eigenvalues of Gn, p
A Coja-Oghlan
Combinatorics, Probability and Computing 16 (6), 923-946, 2007
762007
A spectral heuristic for bisecting random graphs
A Coja‐Oghlan
Random Structures & Algorithms 29 (3), 351-398, 2006
762006
A Better Algorithm for Random k-SAT
A Coja-Oghlan
SIAM Journal on Computing 39 (7), 2823-2864, 2010
742010
A Better Algorithm for Random k-SAT
A Coja-Oghlan
SIAM Journal on Computing 39 (7), 2823-2864, 2010
742010
Chasing the k-colorability threshold
A Coja-Oghlan, D Vilenchik
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 380-389, 2013
732013
Catching the k-NAESAT threshold
A Coja-Oglan, K Panagiotou
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
722012
The condensation phase transition in random graph coloring
V Bapst, A Coja-Oghlan, S Hetterich, F Raßmann, D Vilenchik
Communications in Mathematical Physics 341, 543-606, 2016
652016
Upper-bounding the k-colorability threshold by counting covers
A Coja-Oghlan
arXiv preprint arXiv:1305.0177, 2013
652013
Optimal group testing
A Coja-Oghlan, O Gebhard, M Hahn-Klimroth, P Loick
Conference on Learning Theory, 1374-1388, 2020
622020
Finding planted partitions in random graphs with general degree distributions
A Coja-Oghlan, A Lanka
SIAM Journal on Discrete Mathematics 23 (4), 1682-1714, 2010
622010
Contagious sets in expanders
A Coja-Oghlan, U Feige, M Krivelevich, D Reichman
Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014
602014
Information-theoretic and algorithmic thresholds for group testing
A Coja-Oghlan, O Gebhard, M Hahn-Klimroth, P Loick
IEEE Transactions on Information Theory 66 (12), 7911-7928, 2020
572020
The Lovász number of random graphs
A Coja-Oghlan
Combinatorics, Probability and Computing 14 (4), 439-465, 2005
562005
The system can't perform the operation now. Try again later.
Articles 1–20