Coja-Oghlan, Amin and Zdeborová, Lenka (2012) The condensation transition in random hypergraph 2-coloring. In: ACM-SIAM Symposium on Discrete Algorithms 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms pp. 241-250.

Coja-Oghlan, Amin and Frieze, Alan (2012) Analyzing walksat on random formulas. In: ANALCO '12 : Meeting on Analytic Algorithmics and Combinatorics, Kyoto, Japan, 16 Jan 2012. Published in: Proceedings of the Meeting on Analytic Algorithmics & Combinatorics, Kyoto, Japan, January 16, 2012 pp. 48-55.

Coja-Oghlan, Amin, Onsjoe, Mikael and Watanabe, Osamu. (2012) Propagation connectivity of random hypergraphs. Electronic Journal of Combinatorics, Vol.19 . P17. ISSN 1077-8926

Achlioptas, Dimitris, Coja-Oghlan, Amin and Ricci-Tersenghi, F. (Federico). (2011) On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, Volume 38 (Number 3). pp. 251-268. ISSN 10429832

Coja-Oghlan, Amin and Panagiotou, Konstantinos (2011) Catching the k-NAESAT threshold. Coventry: ArXiv e-prints. (Unpublished)

Coja-Oghlan, Amin (2011) On belief propagation guided decimation for random k-SAT. In: Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 23 - 25 Jan 2011. Published in: SODA '11 Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms pp. 957-966.

Coja-Oghlan, Amin and Efthymiou, Charilaos (2011) On independent sets in random graphs. In: Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 23 - 25 Jan 2011. Published in: SODA '11 Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms pp. 136-144.

Coja-Oghlan, Amin and Pachon-Pinzon, Angelica Y.. (2011) The decimation process in random k-SAT. Lecture Notes in Computer Science, Vol.6755 (Automata, Languages and Programming) . pp. 305-316. ISSN 0302-9743

Coja-Oghlan, Amin, Onsjö, M. and Watanabe, O. (2010) Propagation connectivity of random hypergraphs. In: Approximation, Randomization, and Combinatorial Optimization. Lecture Notes in Computer Science (6302). London: Springer Verlag, pp. 490-503. ISBN 9783642153686

Coja-Oghlan, Amin, Krivelevich, Michael and Vilenchik, Dan. (2010) Why almost all k-colorable graphs are easy to color. Theory of Computing Systems, Vol.46 (No.3). pp. 523-565. ISSN 1432-4350

Behrisch, Michael, Coja-Oghlan, Amin and Kang, Mihyun. (2010) The order of the giant component of random hypergraphs. Random Structures and Algorithms, Vol.36 (No.2). pp. 149-184. ISSN 1042-9832

Coja-Oghlan, Amin and Lanka, André. (2010) Finding planted partitions in random graphs with general degree distributions. SIAM Journal on Discrete Mathematics, Vol.23 (No.4). pp. 1682-1714. ISSN 0895-4801

Coja-Oghlan, Amin. (2010) Graph partitioning via adaptive spectral techniques. Combinatorics, Probability and Computing, Vol.19 (No.2). pp. 227-284. ISSN 0963-5483

Coja-Oghlan, Amin, Onsjoe, Mikael and Watanabe, Osamu (2010) Propagation connectivity of random hypergraphs. In: 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010)/14th International Workshop on Randomization and Computation (RANDOM 2010), Univ Politecnica Catalunya (UPC), Barcelona, Spain, 01-03 Sep 2010. Published in: Lecture Notes in Computer Science, Vol.6302 pp. 490-503.

Alon, Noga, Coja-Oghlan, Amin, Hàn, Hiêp, Kang, Mihyun, Rödl, Vojtěch, 1949- and Schacht, Mathias. (2010) Quasi-randomness and algorithmic regularity for graphs with general degree distributions. SIAM Journal on Computing, Vol.39 (No.6). pp. 2336-2362. ISSN 0097-5397

Coja-Oghlan, Amin. (2010) A better algorithm for random k-SAT. SIAM Journal on Computing, Vol.39 (No.7). pp. 2823-2864. ISSN 0097-5397

Coja-Oghlan, Amin, Cooper, Colin and Frieze, Alan. (2010) An efficient sparse regularity concept. SIAM Journal on Discrete Mathematics, Vol.23 (No.4). pp. 2000-2034. ISSN 0895-4801

Coja-Oghlan, Amin and Kang, Mihyun. (2009) The evolution of the min–min random graph process. Discrete Mathematics, Vol.309 (No.13). pp. 4527-4544. ISSN 0012-365X

Coja-Oghlan, Amin, Feige, Uriel, Frieze, Alan, Krivelevich, Michael and Vilenchik, Dan (2009) On smoothed k-CNF formulas and the Walksat algorithm. In: SODA08 19th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 20-22 Jan 2008. Published in: SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 451-460.

Coja-Oghlan, Amin. (2009) Random constraint satisfaction problems. Electronic Proceedings in Theoretical Computer Science, Vol.9 . pp. 32-37. ISSN 2075-2180

Blum, Avrim, Coja-Oghlan, Amin, Frieze, Alan and Zhou, Shuheng. (2009) Separating populations with wide data : a spectral analysis. Electronic Journal of Statistics, Vol.3 . pp. 76-113. ISSN 1935-7524

Coja-Oghlan, Amin (2009) A better algorithm for random k-SAT. In: 36th International Colloquium, ICALP 2009, Rhodes, Greece, 5-12 Jul 2009. Published in: Automata, Languages and Programming, Vol.5555 pp. 292-303.

Coja-Oghlan, Amin, Cooper, Colin and Frieze, Alan (2009) An efficient sparse regularity concept. In: SODA08 19th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 20-22 Jan 2008. Published in: SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 207-216.

Coja-Oghlan, Amin, Mossel, Elchanan and Vilenchik, Dan. (2009) A spectral approach to analysing belief propagation for 3-colouring. Combinatorics, Probability and Computing, Vol.18 (No.6). pp. 881-912. ISSN 0963-5483

Coja-Oghlan, Amin and Lanka, André. (2009) The spectral gap of random graphs with given expected degrees. Electronic Journal of Combinatorics, Vol.16 (No.1). R138. ISSN 1077-8926

Coja-Oghlan, Amin, Panagiotou, Konstantinos and Steger, Angelika. (2008) On the chromatic number of random graphs. Journal of Combinatorial Theory, Series B, Vol.98 (No.5). pp. 980-993. ISSN 0095-8956

Achlioptas, Dimitris and Coja-Oghlan, Amin (2008) Algorithmic barriers from phase transitions. In: Foundations of Computer Science, 2008. FOCS '08., Philadelphia, PA , 25-28 Oct 2008 . Published in: Symposium on Foundations of Computer Science. Annual Proceedings pp. 793-802.

Coja-Oghlan, Amin and Lanka, André (2008) Partitioning random graphs with general degree distributions. In: Ausiello, Giorgio and Karhumäki, Juhani and Mauri, Giancarlo and Ong, Luke, (eds.) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. Boston: Springer, pp. 127-141. ISBN 9780387096797

Coja-Oghlan, Amin and Frieze, Alan. (2008) Random k-SAT : the limiting probability for satisfiability for moderately growing k. Electronic Journal of Combinatorics, Vol.15 . N2. ISSN 1077-8926