Amin Coja-Oghlan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
37
Venues
10
Active years
2002–2025
Best venue rank
A*
Where they publish
Papers
37 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICALP | Belief Propagation Guided Decimation on Random k-XORSAT. | Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, Gregory B. Sorkin |
| 2022 | COLT | Statistical and Computational Phase Transitions in Group Testing. | Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik |
| 2022 | ICALP | Metastability of the Potts Ferromagnet on Random Regular Graphs. | Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda |
| 2022 | OPODIS | On the Hierarchy of Distributed Majority Protocols. | Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, Malin Rau |
| 2022 | SODA | The Sparse Parity Matrix. | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana |
| 2021 | STACS | Inference and Mutual Information on Random Factor Graphs. | Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Nola Mller, Konstantinos Panagiotou, Matija Pasch |
| 2020 | COLT | Optimal Group Testing. | Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick |
| 2020 | SODA | The rank of sparse random matrices. | Amin Coja-Oghlan, Alperen Ali Ergr, Pu Gao, Samuel Hetterich, Maurice Rolvien |
| 2019 | ICALP | Information-Theoretic and Algorithmic Thresholds for Group Testing. | Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick |
| 2017 | STOC | Information-theoretic thresholds from the cavity method. | Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborov |
| 2015 | SODA | Contagious Sets in Expanders. | Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman |
| 2014 | STOC | The asymptotic k-SAT threshold. | Amin Coja-Oghlan |
| 2013 | FOCS | Chasing the K-Colorability Threshold. | Amin Coja-Oghlan, Dan Vilenchik |
| 2013 | STOC | Going after the k-SAT threshold. | Amin Coja-Oghlan, Konstantinos Panagiotou |
| 2012 | SODA | The condensation transition in random hypergraph 2-coloring. | Amin Coja-Oghlan, Lenka Zdeborov |
| 2012 | STOC | Catching the k-NAESAT threshold. | Amin Coja-Oghlan, Konstantinos Panagiotou |
| 2011 | ICALP | The Decimation Process in Random | Amin Coja-Oghlan, Anglica Y. Pachn-Pinzon |
| 2011 | SODA | On Belief Propagation Guided Decimation for Random k-SAT. | Amin Coja-Oghlan |
| 2011 | SODA | On independent sets in random graphs. | Amin Coja-Oghlan, Charilaos Efthymiou |
| 2009 | ICALP | A Better Algorithm for Random | Amin Coja-Oghlan |
| 2009 | SODA | An efficient sparse regularity concept. | Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze |
| 2009 | SODA | On smoothed | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
| 2008 | FOCS | Algorithmic Barriers from Phase Transitions. | Dimitris Achlioptas, Amin Coja-Oghlan |
| 2007 | ICALP | Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. | Noga Alon, Amin Coja-Oghlan, Hip Hn, Mihyun Kang, Vojtech Rdl, Mathias Schacht |
| 2007 | ICALP | On the Chromatic Number of Random Graphs. | Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger |
| 2007 | ISAAC | Separating Populations with Wide Data: A Spectral Analysis. | Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou |
| 2007 | STACS | Why Almost All | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
| 2006 | ICALP | An Adaptive Spectral Heuristic for Partitioning Random Graphs. | Amin Coja-Oghlan |
| 2006 | ICALP | The Spectral Gap of Random Graphs with Given Expected Degrees. | Amin Coja-Oghlan, Andr Lanka |
| 2005 | SODA | A spectral heuristic for bisecting random graphs. | Amin Coja-Oghlan |
| 2004 | ICALP | Coloring Semirandom Graphs Optimally. | Amin Coja-Oghlan |
| 2003 | FCT | Certifying Unsatisfiability of Random 2 | Amin Coja-Oghlan, Andreas Goerdt, Andr Lanka, Frank Schdlich |
| 2003 | ICALP | MAX k-CUT and Approximating the Chromatic Number of Random Graphs. | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
| 2003 | ISAAC | A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
| 2003 | STACS | Finding Large Independent Sets in Polynomial Expected Time. | Amin Coja-Oghlan |
| 2003 | STACS | Colouring Random Graphs in Expected Polynomial Time. | Amin Coja-Oghlan, Anusch Taraz |
| 2002 | MFCS | Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. | Amin Coja-Oghlan |