An Automata-Theoretic Characterization of the OI-Hierarchy. - Werner Damm; Andreas Goerdt (ICALP, 1982)

A Hoare Calculus for Functions Defined by Recursion on Higher Types. - Andreas Goerdt (Logic of Programs, 1985)

An Automata-Theoretical Characterization of the OI-Hierarchy - Werner Damm; Andreas Goerdt (Inf. Control., 1986)

Ein Hoare Kalkül für die Sprache der getypten Lambda-Terme: Korrektheit, Vollständigkeit, Anwendungen. - Andreas Goerdt (1986)

Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages - Andreas Goerdt (LICS, 1987)

On the Expressive Strength of the Finitely Typed Lambda-Terms. - Andreas Goerdt (MFCS, 1988)

Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. - Andreas Goerdt (MFCS, 1988)

Cuting Plane Versus Frege Proof Systems. - Andreas Goerdt (CSL, 1990)

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. - Andreas Goerdt; Helmut Seidl (IMYCS, 1990)

Comparing the Complexity of Regular and Unrestricted Resolution. - Andreas Goerdt (GWAI, 1990)

The Cutting Plane Proof System with Bounded Degree of Falsity. - Andreas Goerdt (CSL, 1991)

Davis-Putnam Resolution versus Unrestricted Resolution. - Andreas Goerdt (Ann. Math. Artif. Intell., 1992)

Unrestricted Resolution versus N-Resolution. - Andreas Goerdt (Theor. Comput. Sci., 1992)

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. - Andreas Goerdt (Theor. Comput. Sci., 1992)

Characterizing Complexity Classes by General Recursive Definitions in Higher Types - Andreas Goerdt (Inf. Comput., 1992)

On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. - Andreas Goerdt; Udo Kamps (CSL, 1993)

Regular Resolution Versus Unrestricted Resolution. - Andreas Goerdt (SIAM J. Comput., 1993)

A Threshold for Unsatisfiability. - Andreas Goerdt (J. Comput. Syst. Sci., 1996)

The Giant Component Threshold for Random Regular Graphs with Edge Faults. - Andreas Goerdt (MFCS, 1997)

A Remark on Random 2-SAT. - Andreas Goerdt (Discret. Appl. Math., 1999)

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. - Evgeny Dantsin; Andreas Goerdt; Edward A. Hirsch; Uwe Schöning (ICALP, 2000)

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. - Joel Friedman; Andreas Goerdt (ICALP, 2001)

Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. - Andreas Goerdt; Michael Krivelevich (STACS, 2001)

The giant component threshold for random regular graphs with edge faults H. Prodinger. - Andreas Goerdt (Theor. Comput. Sci., 2001)

Random regular graphs with edge faults: Expansion through cores. - Andreas Goerdt (Theor. Comput. Sci., 2001)

A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. - Evgeny Dantsin; Andreas Goerdt; Edward A. Hirsch; Ravi Kannan; Jon M. Kleinberg; Christos H. Papadimitriou; Prabhakar Raghavan; Uwe Schöning (Theor. Comput. Sci., 2002)

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

Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. - Andreas Goerdt; Tomasz Jurdzinski (Comb. Probab. Comput., 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)

Recognizing more random unsatisfiable 3-SAT instances efficiently. - Andreas Goerdt; André Lanka (Electron. Notes Discret. Math., 2003)

Analysis of edge deletion processes on faulty random regular graphs. - Andreas Goerdt; Michael Molloy 001 (Theor. Comput. Sci., 2003)

On the Hardness and Easiness of Random 4-SAT Formulas. - Andreas Goerdt; André Lanka (ISAAC, 2004)

An approximation hardness result for bipartite Clique - André Lanka; Andreas Goerdt (Electron. Colloquium Comput. Complex., 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)

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. - Joel Friedman; Andreas Goerdt; Michael Krivelevich (SIAM J. Comput., 2005)

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

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

On Random Ordering Constraints. - Andreas Goerdt (CSR, 2009)

Tight Thresholds for Cuckoo Hashing via XORSAT. - Martin Dietzfelbinger; Andreas Goerdt; Michael Mitzenmacher; Andrea Montanari; Rasmus Pagh; Michael Rink 001 (ICALP (1), 2010)

On Random Betweenness Constraints. - Andreas Goerdt (Comb. Probab. Comput., 2010)

Satisfiability Thresholds beyond k -XORSAT. - Andreas Goerdt; Lutz Falke (CSR, 2012)

Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. - Andreas Goerdt (CSR, 2019)