Obserwuj
Amin Coja-Oghlan
Amin Coja-Oghlan
TU Dortmund
Zweryfikowany adres z tu-dortmund.de - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Algorithmic barriers from phase transitions
D Achlioptas, A Coja-Oghlan
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 793-802, 2008
2972008
Graph partitioning via adaptive spectral techniques
A Coja-Oghlan
Combinatorics, Probability and Computing 19 (2), 227-284, 2010
1782010
The asymptotic k-SAT threshold
A Coja-Oghlan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1252014
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
1152017
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
1002011
On independent sets in random graphs
A Coja‐Oghlan, C Efthymiou
Random Structures & Algorithms 47 (3), 436-486, 2015
932015
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
852012
A spectral heuristic for bisecting random graphs
A Coja‐Oghlan
Random Structures & Algorithms 29 (3), 351-398, 2006
772006
On the Laplacian eigenvalues of Gn, p
A Coja-Oghlan
Combinatorics, Probability and Computing 16 (6), 923-946, 2007
732007
Chasing the k-colorability threshold
A Coja-Oghlan, D Vilenchik
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 380-389, 2013
692013
A Better Algorithm for Random k-SAT
A Coja-Oghlan
SIAM Journal on Computing 39 (7), 2823-2864, 2010
692010
A Better Algorithm for Random k-SAT
A Coja-Oghlan
SIAM Journal on Computing 39 (7), 2823-2864, 2010
692010
Catching the k-NAESAT threshold
A Coja-Oglan, K Panagiotou
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
662012
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
602010
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
582016
Upper-bounding the k-colorability threshold by counting covers
A Coja-Oghlan
arXiv preprint arXiv:1305.0177, 2013
562013
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
552014
The Lovász number of random graphs
A Coja-Oghlan
Combinatorics, Probability and Computing 14 (4), 439-465, 2005
552005
Going after the k-SAT threshold
A Coja-Oghlan, K Panagiotou
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
542013
An efficient sparse regularity concept
A Coja-Oghlan, C Cooper, A Frieze
SIAM Journal on Discrete Mathematics 23 (4), 2000-2034, 2010
492010
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20