Amin Coja-Oghlan

Citace

	Všechny	Od 2018
Citace	3564	1783
h-index	32	24
i10-index	78	51

360

180

270

20032004200520062007200820092010201120122013201420152016201720182019202020212022202320 30 44 70 51 58 54 69 58 116 153 178 241 287 278 263 274 276 299 345 317

Veřejný přístup

Zobrazit všechny

57 článků

4 články

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Mihyun KangProfessor, Graz University of TechnologyE-mailová adresa ověřena na: math.tugraz.at
Dan VilenchikSchool of Electrical and Computer Engineering, Ben-Gurion UniversityE-mailová adresa ověřena na: bgu.ac.il
Max Hahn-KlimrothPostdoc at TU Dortmund UniversityE-mailová adresa ověřena na: cs.tu-dortmund.de
Dimitris AchlioptasProfessor of Computer Science, University of AthensE-mailová adresa ověřena na: di.uoa.gr
Konstantinos PanagiotouUniversity of MunichE-mailová adresa ověřena na: math.lmu.de
Charilaos EfthymiouThe University of WarwickE-mailová adresa ověřena na: warwick.ac.uk
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityE-mailová adresa ověřena na: post.tau.ac.il
Will PerkinsGeorgia Institute of TechnologyE-mailová adresa ověřena na: willperkins.org
Alan FriezeCarnegie Mellon UniversityE-mailová adresa ověřena na: random.math.cmu.edu
Cristopher MooreSanta Fe InstituteE-mailová adresa ověřena na: santafe.edu
Noela MüllerEindhoven University of TechnologyE-mailová adresa ověřena na: tue.nl
Pu (Jane) GaoUniversity of WaterlooE-mailová adresa ověřena na: uwaterloo.ca
Lenka ZdeborovaEPFL, SwitzerlandE-mailová adresa ověřena na: epfl.ch
Uriel FeigeProfessor of Computer Science, Weizmann Institute of ScienceE-mailová adresa ověřena na: weizmann.ac.il
Daniel ReichmanWorcester Polytechnic InstituteE-mailová adresa ověřena na: wpi.edu
Catherine GreenhillSchool of Mathematics and Statistics, UNSW SydneyE-mailová adresa ověřena na: unsw.edu.au
Florent KrzakalaÉcole polytechnique fédérale de LausanneE-mailová adresa ověřena na: epfl.ch

Sledovat

Amin Coja-Oghlan

TU Dortmund

E-mailová adresa ověřena na: tu-dortmund.de - Domovská stránka

Combinatorics probability theory algorithms and complexity


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Algorithmic barriers from phase transitions D Achlioptas, A Coja-Oghlan 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 793-802, 2008	317	2008
Graph partitioning via adaptive spectral techniques A Coja-Oghlan Combinatorics, Probability and Computing 19 (2), 227-284, 2010	189	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	134	2017
The asymptotic k-SAT threshold A Coja-Oghlan Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	133	2014
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	107	2011
On independent sets in random graphs A Coja‐Oghlan, C Efthymiou Random Structures & Algorithms 47 (3), 436-486, 2015	100	2015
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	91	2012
On the Laplacian eigenvalues of Gn, p A Coja-Oghlan Combinatorics, Probability and Computing 16 (6), 923-946, 2007	75	2007
A spectral heuristic for bisecting random graphs A Coja‐Oghlan Random Structures & Algorithms 29 (3), 351-398, 2006	75	2006
Chasing the k-colorability threshold A Coja-Oghlan, D Vilenchik 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 380-389, 2013	71	2013
A Better Algorithm for Random k-SAT A Coja-Oghlan SIAM Journal on Computing 39 (7), 2823-2864, 2010	71	2010
A Better Algorithm for Random k-SAT A Coja-Oghlan SIAM Journal on Computing 39 (7), 2823-2864, 2010	71	2010
Catching the k-NAESAT threshold A Coja-Oglan, K Panagiotou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	70	2012
Upper-bounding the k-colorability threshold by counting covers A Coja-Oghlan arXiv preprint arXiv:1305.0177, 2013	65	2013
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	62	2016
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	61	2010
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	58	2014
Optimal group testing A Coja-Oghlan, O Gebhard, M Hahn-Klimroth, P Loick Conference on Learning Theory, 1374-1388, 2020	57	2020
Going after the k-SAT threshold A Coja-Oghlan, K Panagiotou Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	55	2013
The Lovász number of random graphs A Coja-Oghlan Combinatorics, Probability and Computing 14 (4), 439-465, 2005	55	2005

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři