| Algorithmic barriers from phase transitions D Achlioptas, A Coja-Oghlan 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 793-802, 2008 | 377 | 2008 |
| Graph partitioning via adaptive spectral techniques A Coja-Oghlan Combinatorics, Probability and Computing 19 (2), 227-284, 2010 | 222 | 2010 |
| 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 | 169 | 2017 |
| The asymptotic k-SAT threshold A Coja-Oghlan Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 163 | 2014 |
| On independent sets in random graphs A Coja‐Oghlan, C Efthymiou Random Structures & Algorithms 47 (3), 436-486, 2015 | 137 | 2015 |
| 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 | 135 | 2011 |
| The chromatic number of random graphs for most average degrees A Coja-Oghlan, D Vilenchik International Mathematics Research Notices 2016 (19), 5801-5859, 2016 | 108* | 2016 |
| 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 | 102 | 2012 |
| Optimal group testing A Coja-Oghlan, O Gebhard, M Hahn-Klimroth, P Loick Conference on Learning Theory, 1374-1388, 2020 | 95 | 2020 |
| On the Laplacian eigenvalues of Gn, p A Coja-Oghlan Combinatorics, Probability and Computing 16 (6), 923-946, 2007 | 89 | 2007 |
| A Better Algorithm for Random k-SAT A Coja-Oghlan SIAM Journal on Computing 39 (7), 2823-2864, 2010 | 88 | 2010 |
| Catching the k-NAESAT threshold A Coja-Oglan, K Panagiotou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 84 | 2012 |
| A spectral heuristic for bisecting random graphs A Coja‐Oghlan Random Structures & Algorithms 29 (3), 351-398, 2006 | 77 | 2006 |
| 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 (2), 543-606, 2016 | 73 | 2016 |
| 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 | 71 | 2020 |
| 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 | 70 | 2014 |
| Upper-bounding the k-colorability threshold by counting covers A Coja-Oghlan arXiv preprint arXiv:1305.0177, 2013 | 67 | 2013 |
| An efficient sparse regularity concept A Coja-Oghlan, C Cooper, A Frieze SIAM Journal on Discrete Mathematics 23 (4), 2000-2034, 2010 | 67 | 2010 |
| The Lovász number of random graphs A Coja-Oghlan Combinatorics, Probability and Computing 14 (4), 439-465, 2005 | 64 | 2005 |
| 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 | 62 | 2010 |
Mihyun KangProfessor, Graz University of TechnologyVerified email at math.tugraz.at
