Varianz und Erwartungswert in Operatoralgebren. - Amin Coja-Oghlan (Shaker, 2002)

Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. - Amin Coja-Oghlan (MFCS, 2002)

Finding Sparse Induced Subgraphs of Semirandom Graphs. - Amin Coja-Oghlan (RANDOM, 2002)

Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich (FCT, 2003)

MAX k-CUT and Approximating the Chromatic Number of Random Graphs. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (ICALP, 2003)

Colouring Random Graphs in Expected Polynomial Time. - Amin Coja-Oghlan; Anusch Taraz (STACS, 2003)

Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques - Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich (Electron. Colloquium Comput. Complex., 2003)

The Lovasz number of random graph - Amin Coja-Oghlan (Electron. Colloquium Comput. Complex., 2003)

Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy. - Amin Coja-Oghlan; Mark-Oliver Stehr (Fundam. Informaticae, 2003)

Coloring Semirandom Graphs Optimally. - Amin Coja-Oghlan (ICALP, 2004)

Exact and approximative algorithms for coloring G(n, p). - Amin Coja-Oghlan; Anusch Taraz (Random Struct. Algorithms, 2004)

Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich (Theor. Comput. Sci., 2004)

The Lovász Number of Random Graphs. - Amin Coja-Oghlan (Comb. Probab. Comput., 2005)

A Hard Dial-a-Ride Problem that is Easy on Average. - Amin Coja-Oghlan; Sven Oliver Krumke; Till Nierhoff (J. Sched., 2005)

An Adaptive Spectral Heuristic for Partitioning Random Graphs. - Amin Coja-Oghlan (ICALP (1), 2006)

Spectral Partitioning of Random Graphs with Given Expected Degrees. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka (IFIP TCS, 2006)

Finding Large Independent Sets in Polynomial Expected Time. - Amin Coja-Oghlan (Comb. Probab. Comput., 2006)

Graph partitioning via adaptive spectral techniques. - Amin Coja-Oghlan (Electron. Colloquium Comput. Complex., 2006)

An improved algorithm for approximating the chromatic number of Gn, p. - Amin Coja-Oghlan; Lars Kuhtz (Inf. Process. Lett., 2006)

A heuristic for the Stacker Crane Problem on trees which is almost surely exact. - Amin Coja-Oghlan; Sven Oliver Krumke; Till Nierhoff (J. Algorithms, 2006)

A spectral heuristic for bisecting random graphs. - Amin Coja-Oghlan (Random Struct. Algorithms, 2006)

MAX k-CUT and approximating the chromatic number of random graphs. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (Random Struct. Algorithms, 2006)

Separating Populations with Wide Data: A Spectral Analysis. - Avrim Blum; Amin Coja-Oghlan; Alan M. Frieze; Shuheng Zhou 002 (ISAAC, 2007)

Why Almost All k -Colorable Graphs Are Easy. - Amin Coja-Oghlan; Michael Krivelevich; Dan Vilenchik (STACS, 2007)

A Spectral Approach to Analyzing Belief Propagation for 3-Coloring - Amin Coja-Oghlan; Elchanan Mossel; Dan Vilenchik (CoRR, 2007)

Colouring Semirandom Graphs. - Amin Coja-Oghlan (Comb. Probab. Comput., 2007)

On the Laplacian Eigenvalues of Gn, p. - Amin Coja-Oghlan (Comb. Probab. Comput., 2007)

Strong Refutation Heuristics for Random k-SAT. - Amin Coja-Oghlan; Andreas Goerdt; André Lanka (Comb. Probab. Comput., 2007)

Solving NP-hard semirandom graph problems in polynomial expected time. - Amin Coja-Oghlan (J. Algorithms, 2007)

Counting connected graphs and hypergraphs via the probabilistic method. - Amin Coja-Oghlan; Cristopher Moore; Vishal Sanwalani (Random Struct. Algorithms, 2007)

Algorithmic Barriers from Phase Transitions. - Dimitris Achlioptas; Amin Coja-Oghlan (FOCS, 2008)

Partitioning Random Graphs with General Degree Distributions. - Amin Coja-Oghlan; André Lanka (IFIP TCS, 2008)

Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. - Amin Coja-Oghlan; Alan M. Frieze (Electron. J. Comb., 2008)

On the chromatic number of random graphs. - Amin Coja-Oghlan; Konstantinos Panagiotou; Angelika Steger (J. Comb. Theory B, 2008)

Die Eulertour. - Michael Behrisch 002; Amin Coja-Oghlan; Peter Liske (Taschenbuch der Algorithmen, 2008)

A Better Algorithm for Random k-SAT. - Amin Coja-Oghlan (ICALP (1), 2009)

On smoothed k-CNF formulas and the Walksat algorithm. - Amin Coja-Oghlan; Uriel Feige; Alan M. Frieze; Michael Krivelevich; Dan Vilenchik (SODA, 2009)

The Spectral Gap of Random Graphs with Given Expected Degrees. - Amin Coja-Oghlan; André Lanka (Electron. J. Comb., 2009)

Random Constraint Satisfaction Problems - Amin Coja-Oghlan (DCM, 2009)

A Spectral Approach to Analysing Belief Propagation for 3-Colouring. - Amin Coja-Oghlan; Elchanan Mossel; Dan Vilenchik (Comb. Probab. Comput., 2009)

The evolution of the min-min random graph process. - Amin Coja-Oghlan; Mihyun Kang (Discret. Math., 2009)

Finding Planted Partitions in Random Graphs with General Degree Distributions. - Amin Coja-Oghlan; André Lanka (SIAM J. Discret. Math., 2009)

Why Almost All k-Colorable Graphs Are Easy to Color. - Amin Coja-Oghlan; Michael Krivelevich; Dan Vilenchik (Theory Comput. Syst., 2010)

The order of the giant component of random hypergraphs. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Random Struct. Algorithms, 2010)

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. - Noga Alon; Amin Coja-Oghlan; Hiêp Hàn; Mihyun Kang; Vojtech Rödl; Mathias Schacht (SIAM J. Comput., 2010)

A Better Algorithm for Random k-SAT. - Amin Coja-Oghlan (SIAM J. Comput., 2010)

An Efficient Sparse Regularity Concept. - Amin Coja-Oghlan; Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2010)

Eulerian Circuits. - Michael Behrisch 002; Amin Coja-Oghlan; Peter Liske (Algorithms Unplugged, 2011)

The Decimation Process in Random k-SAT. - Amin Coja-Oghlan; Angélica Y. Pachón-Pinzon (ICALP (1), 2011)

On Belief Propagation Guided Decimation for Random k-SAT. - Amin Coja-Oghlan (SODA, 2011)

On the solution-space geometry of random constraint satisfaction problems. - Dimitris Achlioptas; Amin Coja-Oghlan; Federico Ricci-Tersenghi (Random Struct. Algorithms, 2011)

The condensation transition in random hypergraph 2-coloring. - Amin Coja-Oghlan; Lenka Zdeborová (SODA, 2012)

Catching the k-NAESAT threshold. - Amin Coja-Oghlan; Konstantinos Panagiotou (STOC, 2012)

Propagation Connectivity of Random Hypergraphs. - Amin Coja-Oghlan; Mikael Onsjö; Osamu Watanabe 001 (Electron. J. Comb., 2012)

The Decimation Process in Random k-SAT. - Amin Coja-Oghlan; Angélica Y. Pachón-Pinzon (SIAM J. Discret. Math., 2012)

Chasing the K-Colorability Threshold. - Amin Coja-Oghlan; Dan Vilenchik (FOCS, 2013)

Going after the k-SAT threshold. - Amin Coja-Oghlan; Konstantinos Panagiotou (STOC, 2013)

Upper-Bounding the k-Colorability Threshold by Counting Covers. - Amin Coja-Oghlan (Electron. J. Comb., 2013)

Random regular k-SAT. - Amin Coja-Oghlan (CoRR, 2013)

The Condensation Phase Transition in Random Graph Coloring. - Victor Bapst; Amin Coja-Oghlan; Samuel Hetterich; Felicia Raßmann; Dan Vilenchik (APPROX-RANDOM, 2014)

The asymptotic k-SAT threshold. - Amin Coja-Oghlan (STOC, 2014)

A positive temperature phase transition in random hypergraph 2-coloring. - Victor Bapst; Amin Coja-Oghlan; Felicia Raßmann (CoRR, 2014)

Local Limit Theorems for the Giant Component of Random Hypergraphs. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Comb. Probab. Comput., 2014)

The Asymptotic Number of Connected d-Uniform Hypergraphs. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Comb. Probab. Comput., 2014)

Analyzing Walksat on Random Formulas. - Amin Coja-Oghlan; Alan M. Frieze (SIAM J. Comput., 2014)

Contagious Sets in Expanders. - Amin Coja-Oghlan; Uriel Feige; Michael Krivelevich; Daniel Reichman 001 (SODA, 2015)

'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM. - Michael Behrisch 002; Amin Coja-Oghlan; Mihyun Kang (Comb. Probab. Comput., 2015)

How does the core sit inside the mantle? - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (Electron. Notes Discret. Math., 2015)

On independent sets in random graphs. - Amin Coja-Oghlan; Charilaos Efthymiou 001 (Random Struct. Algorithms, 2015)

The Condensation Phase Transition in the Regular k-SAT Model. - Victor Bapst; Amin Coja-Oghlan (APPROX-RANDOM, 2016)

Belief Propagation on Replica Symmetric Random Factor Graph Models. - Amin Coja-Oghlan; Will Perkins 001 (APPROX-RANDOM, 2016)

On the Potts Antiferromagnet on Random Graphs. - Amin Coja-Oghlan; Nor Jaafari (Electron. J. Comb., 2016)

On the chromatic number of random regular graphs. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Samuel Hetterich (J. Comb. Theory B, 2016)

Harnessing the Bethe free energy. - Victor Bapst; Amin Coja-Oghlan (Random Struct. Algorithms, 2016)

Charting the Replica Symmetric Phase. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Nor Jaafari; Mihyun Kang; Tobias Kapetanopoulos (APPROX-RANDOM, 2017)

Information-theoretic thresholds from the cavity method. - Amin Coja-Oghlan; Florent Krzakala; Will Perkins 001; Lenka Zdeborová (STOC, 2017)

Core forging and local limit theorems for the k-core of random graphs. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (CoRR, 2017)

Planting Colourings Silently. - Victor Bapst; Amin Coja-Oghlan; Charilaos Efthymiou 001 (Comb. Probab. Comput., 2017)

Limits of discrete distributions and Gibbs measures on random graphs. - Amin Coja-Oghlan; Will Perkins 001; Kathrin Skubch (Eur. J. Comb., 2017)

Belief Propagation Guided Decimation Fails on Random Formulas. - Amin Coja-Oghlan (J. ACM, 2017)

Walksat Stalls Well Below Satisfiability. - Amin Coja-Oghlan; Amir Haqshenas; Samuel Hetterich (SIAM J. Discret. Math., 2017)

The Minimum Bisection in the Planted Bisection Model. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (Theory Comput., 2017)

Local Convergence of Random Graph Colorings. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Nor Jaafari (Comb., 2018)

The rank of random matrices over finite fields. - Amin Coja-Oghlan; Pu Gao (CoRR, 2018)

The Number of Satisfying Assignments of Random Regular k-SAT Formulas. - Amin Coja-Oghlan; Nick Wormald (Comb. Probab. Comput., 2018)

The rank of sparse random matrices. - Amin Coja-Oghlan; Alperen Ali Ergür; Samuel Hetterich; Maurice Rolvien (CoRR, 2019)

Optimal non-adaptive group testing. - Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Philipp Loick (CoRR, 2019)

Core forging and local limit theorems for the k-core of random graphs. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Kathrin Skubch (J. Comb. Theory B, 2019)

Hypergraph coloring up to condensation. - Peter J. Ayre; Amin Coja-Oghlan; Catherine S. Greenhill (Random Struct. Algorithms, 2019)

The Satisfiability Threshold For Random Linear Equations. - Peter J. Ayre; Amin Coja-Oghlan; Pu Gao; Noëla Müller (Comb., 2020)

The random 2-SAT partition function. - Dimitris Achlioptas; Amin Coja-Oghlan; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Manuel Penschuck; Guangyan Zhou (CoRR, 2020)

Belief Propagation on the random k-SAT model. - Amin Coja-Oghlan; Noëla Müller; Jean B. Ravelomanana (CoRR, 2020)

The replica symmetric phase of random constraint satisfaction problems. - Amin Coja-Oghlan; Tobias Kapetanopoulos; Noëla Müller (Comb. Probab. Comput., 2020)

Information-Theoretic and Algorithmic Thresholds for Group Testing. - Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Philipp Loick (IEEE Trans. Inf. Theory, 2020)

Inference and Mutual Information on Random Factor Graphs. - Amin Coja-Oghlan; Max Hahn-Klimroth; Philipp Loick; Noëla Müller; Konstantinos Panagiotou; Matija Pasch (STACS, 2021)

Optimal group testing. - Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Philipp Loick (Comb. Probab. Comput., 2021)

The number of satisfying assignments of random 2-SAT formulas. - Dimitris Achlioptas; Amin Coja-Oghlan; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Manuel Penschuck; Guangyan Zhou (Random Struct. Algorithms, 2021)

The Cut Metric for Probability Distributions. - Amin Coja-Oghlan; Max Hahn-Klimroth (SIAM J. Discret. Math., 2021)

Statistical and Computational Phase Transitions in Group Testing. - Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Alexander S. Wein; Ilias Zadik (COLT, 2022)

Metastability of the Potts Ferromagnet on Random Regular Graphs. - Amin Coja-Oghlan; Andreas Galanis; Leslie Ann Goldberg; Jean Bernoulli Ravelomanana; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

On the Hierarchy of Distributed Majority Protocols. - Petra Berenbrink; Amin Coja-Oghlan; Oliver Gebhard; Max Hahn-Klimroth; Dominik Kaaser; Malin Rau (OPODIS, 2022)

The Sparse Parity Matrix. - Amin Coja-Oghlan; Oliver Cooley; Mihyun Kang; Joon Lee; Jean Bernoulli Ravelomanana (SODA, 2022)

Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study. - Amin Coja-Oghlan; Max Hahn-Klimroth; Philipp Loick; Manuel Penschuck (SEA, 2022)

Lower Bounds on the Chromatic Number of Random Graphs. - Peter J. Ayre; Amin Coja-Oghlan; Catherine S. Greenhill (Comb., 2022)

The Ising Antiferromagnet and Max Cut on Random Regular Graphs. - Amin Coja-Oghlan; Philipp Loick; Balázs F. Mezei; Gregory B. Sorkin (SIAM J. Discret. Math., 2022)

The Full Rank Condition for Sparse Random Matrices. - Amin Coja-Oghlan; Jane Gao; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Maurice Rolvien (APPROX/RANDOM, 2023)

The rank of sparse random matrices. - Amin Coja-Oghlan; Alperen Ali Ergür; Pu Gao; Samuel Hetterich; Maurice Rolvien (Random Struct. Algorithms, 2023)

The Number of Random 2-SAT Solutions Is Asymptotically Log-Normal. - Arnab Chatterjee; Amin Coja-Oghlan; Noëla Müller; Connor Riddlesden; Maurice Rolvien; Pavel Zakharov; Haodong Zhu (APPROX/RANDOM, 2024)

The $k$-XORSAT Threshold Revisited. - Amin Coja-Oghlan; Mihyun Kang; Lena Krieg; Maurice Rolvien (Electron. J. Comb., 2024)

Bad local minima exist in the stochastic block model. - Amin Coja-Oghlan; Lena Krieg; Johannes Christian Lawnik; Olga Scheftelowitsch (CoRR, 2024)

WalkSAT is linear on random 2-SAT. - Petra Berenbrink; Amin Coja-Oghlan; Colin Cooper; Thorsten Götte; Lukas Hintze; Pavel Zakharov (CoRR, 2024)

The full rank condition for sparse random matrices. - Amin Coja-Oghlan; Pu Gao; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Maurice Rolvien (Comb. Probab. Comput., 2024)

Belief Propagation Guided Decimation on Random k-XORSAT. - Arnab Chatterjee; Amin Coja-Oghlan; Mihyun Kang; Lena Krieg; Maurice Rolvien; Gregory B. Sorkin (ICALP, 2025)

Noisy group testing via spatial coupling. - Amin Coja-Oghlan; Max Hahn-Klimroth; Lukas Hintze; Dominik Kaaser; Lena Krieg; Maurice Rolvien; Olga Scheftelowitsch (Comb. Probab. Comput., 2025)

The random k-SAT Gibbs uniqueness threshold revisited. - Arnab Chatterjee; Amin Coja-Oghlan; Catherine S. Greenhill; Vincent Pfenninger; Maurice Rolvien; Pavel Zakharov; Kostas Zampetakis (CoRR, 2025)