| 2019 | CSR | Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. | Andreas Goerdt |
| 2012 | CSR | Satisfiability Thresholds beyond k -XORSAT. | Andreas Goerdt, Lutz Falke |
| 2010 | ICALP | Tight Thresholds for Cuckoo Hashing via XORSAT. | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
| 2009 | CSR | On Random Ordering Constraints. | Andreas Goerdt |
| 2009 | FCT | On Random Betweenness Constraints. | Andreas Goerdt |
| 2004 | ISAAC | On the Hardness and Easiness of Random 4-SAT Formulas. | Andreas Goerdt, Andr Lanka |
| 2003 | FCT | Certifying Unsatisfiability of Random 2 | Amin Coja-Oghlan, Andreas Goerdt, Andr Lanka, Frank Schdlich |
| 2002 | MFCS | Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. | Andreas Goerdt, Tomasz Jurdzinski |
| 2001 | ICALP | Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. | Joel Friedman, Andreas Goerdt |
| 2001 | STACS | Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. | Andreas Goerdt, Michael Krivelevich |
| 2000 | ICALP | Deterministic Algorithms for | Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schning |
| 2000 | LATIN | Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. | Andreas Goerdt, Michael Molloy |
| 1998 | ISAAC | Random Regular Graphs with Edge Faults: Expansion through Cores. | Andreas Goerdt |
| 1997 | MFCS | The Giant Component Threshold for Random Regular Graphs with Edge Faults. | Andreas Goerdt |
| 1993 | CSL | On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. | Andreas Goerdt, Udo Kamps |
| 1992 | MFCS | A Threshold for Unsatisfiability. | Andreas Goerdt |
| 1991 | CSL | The Cutting Plane Proof System with Bounded Degree of Falsity. | Andreas Goerdt |
| 1990 | CSL | Cuting Plane Versus Frege Proof Systems. | Andreas Goerdt |
| 1990 | KI | Comparing the Complexity of Regular and Unrestricted Resolution. | Andreas Goerdt |
| 1990 | MFCS | Unrestricted Resolution versus N-Resolution. | Andreas Goerdt |
| 1989 | CSL | Davis-Putnam Resolution versus Unrestricted Resolution. | Andreas Goerdt |
| 1989 | LICS | Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions | Andreas Goerdt |
| 1988 | CSL | Characterizing Complexity Classes by General Recursive Definitions in Higher Types. | Andreas Goerdt |
| 1988 | MFCS | On the Expressive Strength of the Finitely Typed Lambda-Terms. | Andreas Goerdt |
| 1988 | MFCS | Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. | Andreas Goerdt |
| 1987 | LICS | Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages | Andreas Goerdt |
| 1982 | ICALP | An Automata-Theoretic Characterization of the OI-Hierarchy. | Werner Damm, Andreas Goerdt |