Andreas Goerdt

Publication Activity (10 Years)

Years Active: 1982-2019
Publications (10 Years): 1

Top Venues

CSR

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Andreas Goerdt
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. CSR (2019)
Andreas Goerdt, Lutz Falke
Satisfiability Thresholds beyond k -XORSAT. CSR (2012)
Andreas Goerdt, Lutz Falke
Satisfiability thresholds beyond k-XORSAT CoRR (2011)
Andreas Goerdt
On Random Betweenness Constraints. Comb. Probab. Comput. 19 (5-6) (2010)
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) (2010)
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
Tight Thresholds for Cuckoo Hashing via XORSAT CoRR (2009)
Andreas Goerdt
On Random Ordering Constraints. CSR (2009)
Andreas Goerdt
On Random Betweenness Constraints. FCT (2009)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
Strong Refutation Heuristics for Random k-SAT. Comb. Probab. Comput. 16 (1) (2007)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
Spectral Partitioning of Random Graphs with Given Expected Degrees. IFIP TCS (2006)
Joel Friedman, Andreas Goerdt, Michael Krivelevich
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35 (2) (2005)
André Lanka, Andreas Goerdt
An approximation hardness result for bipartite Clique Electron. Colloquium Comput. Complex. (048) (2004)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theor. Comput. Sci. 329 (1-3) (2004)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka
Strong Refutation Heuristics for Random k-SAT. APPROX-RANDOM (2004)
Andreas Goerdt, André Lanka
On the Hardness and Easiness of Random 4-SAT Formulas. ISAAC (2004)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
-SAT Formulas Using Approximation Techniques. FCT (2003)
Andreas Goerdt, André Lanka
Recognizing more random unsatisfiable 3-SAT instances efficiently. Electron. Notes Discret. Math. 16 (2003)
Andreas Goerdt, Michael Molloy
Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. 297 (1-3) (2003)
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques Electron. Colloquium Comput. Complex. 10 (030) (2003)
Andreas Goerdt, Tomasz Jurdzinski
Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. Comb. Probab. Comput. 12 (3) (2003)
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
algorithm for k-SAT based on local search. Theor. Comput. Sci. 289 (1) (2002)
Andreas Goerdt, Tomasz Jurdzinski
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. MFCS (2002)
Andreas Goerdt, Michael Krivelevich
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. STACS (2001)
Joel Friedman, Andreas Goerdt
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. ICALP (2001)
Andreas Goerdt
The giant component threshold for random regular graphs with edge faults H. Prodinger. Theor. Comput. Sci. 259 (1-2) (2001)
Andreas Goerdt
Random regular graphs with edge faults: Expansion through cores. Theor. Comput. Sci. 264 (1) (2001)
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
-SAT Based on Covering Codes and Local Search. ICALP (2000)
Andreas Goerdt, Michael Molloy
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN (2000)
Andreas Goerdt
A Remark on Random 2-SAT. Discret. Appl. Math. (1999)
Andreas Goerdt
Random Regular Graphs with Edge Faults: Expansion through Cores. ISAAC (1998)
Andreas Goerdt
The Giant Component Threshold for Random Regular Graphs with Edge Faults. MFCS (1997)
Andreas Goerdt
A Threshold for Unsatisfiability. J. Comput. Syst. Sci. 53 (3) (1996)
Andreas Goerdt
Regular Resolution Versus Unrestricted Resolution. SIAM J. Comput. 22 (4) (1993)
Andreas Goerdt, Udo Kamps
On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. CSL (1993)
Andreas Goerdt
Unrestricted Resolution versus N-Resolution. Theor. Comput. Sci. 93 (1) (1992)
Andreas Goerdt
Characterizing Complexity Classes by General Recursive Definitions in Higher Types Inf. Comput. 101 (2) (1992)
Andreas Goerdt
A Threshold for Unsatisfiability. MFCS (1992)
Andreas Goerdt
Davis-Putnam Resolution versus Unrestricted Resolution. Ann. Math. Artif. Intell. 6 (1-3) (1992)
Andreas Goerdt
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. Theor. Comput. Sci. 100 (1) (1992)
Andreas Goerdt
The Cutting Plane Proof System with Bounded Degree of Falsity. CSL (1991)
Andreas Goerdt, Helmut Seidl
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS (1990)
Andreas Goerdt
Cuting Plane Versus Frege Proof Systems. CSL (1990)
Andreas Goerdt
Comparing the Complexity of Regular and Unrestricted Resolution. GWAI (1990)
Andreas Goerdt
Unrestricted Resolution versus N-Resolution. MFCS (1990)
Andreas Goerdt
Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions LICS (1989)
Andreas Goerdt
Davis-Putnam Resolution versus Unrestricted Resolution. CSL (1989)
Andreas Goerdt
On the Expressive Strength of the Finitely Typed Lambda-Terms. MFCS (1988)
Andreas Goerdt
Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. MFCS (1988)
Andreas Goerdt
Characterizing Complexity Classes by General Recursive Definitions in Higher Types. CSL (1988)
Andreas Goerdt
Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages LICS (1987)
Werner Damm, Andreas Goerdt
An Automata-Theoretical Characterization of the OI-Hierarchy Inf. Control. 71 (1/2) (1986)
Andreas Goerdt
A Hoare Calculus for Functions Defined by Recursion on Higher Types. Logic of Programs (1985)
Werner Damm, Andreas Goerdt
An Automata-Theoretic Characterization of the OI-Hierarchy. ICALP (1982)

Andreas Goerdt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Goerdt