Andreas Goerdt

Affiliations:

Chemnitz University of Technology, Germany

According to our database¹, Andreas Goerdt authored at least 42 papers between 1982 and 2019.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2019

Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Computer Science - Theory and Applications, 2019

2012

Satisfiability Thresholds beyond k -XORSAT.

[BibT_eX]

[DOI]

Andreas Goerdt

Lutz Falke

Proceedings of the Computer Science - Theory and Applications, 2012

2010

On Random Betweenness Constraints.

[BibT_eX]

[DOI]

Andreas Goerdt

Comb. Probab. Comput., 2010

Tight Thresholds for Cuckoo Hashing via XORSAT.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

On Random Ordering Constraints.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Computer Science, 2009

2007

Strong Refutation Heuristics for Random k-SAT.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Andreas Goerdt

André Lanka

Comb. Probab. Comput., 2007

2006

Spectral Partitioning of Random Graphs with Given Expected Degrees.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Andreas Goerdt

André Lanka

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.

[BibT_eX]

[DOI]

Joel Friedman

Andreas Goerdt

Michael Krivelevich

SIAM J. Comput., 2005

2004

Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

An approximation hardness result for bipartite Clique

[BibT_eX]

[DOI]

André Lanka

Andreas Goerdt

Electron. Colloquium Comput. Complex., 2004

On the Hardness and Easiness of Random 4-SAT Formulas.

[BibT_eX]

[DOI]

Andreas Goerdt

André Lanka

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Analysis of edge deletion processes on faulty random regular graphs.

[BibT_eX]

[DOI]

Andreas Goerdt

Michael Molloy

Theor. Comput. Sci., 2003

Recognizing more random unsatisfiable 3-SAT instances efficiently.

[BibT_eX]

[DOI]

Andreas Goerdt

André Lanka

Electron. Notes Discret. Math., 2003

Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures.

[BibT_eX]

[DOI]

Andreas Goerdt

Tomasz Jurdzinski

Comb. Probab. Comput., 2003

Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Prabhakar Raghavan

Uwe Schöning

Theor. Comput. Sci., 2002

2001

Random regular graphs with edge faults: Expansion through cores.

[BibT_eX]

[DOI]

Andreas Goerdt

Theor. Comput. Sci., 2001

The giant component threshold for random regular graphs with edge faults H. Prodinger.

[BibT_eX]

[DOI]

Andreas Goerdt

Theor. Comput. Sci., 2001

Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.

[BibT_eX]

[DOI]

Andreas Goerdt

Michael Krivelevich

Proceedings of the STACS 2001, 2001

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.

[BibT_eX]

[DOI]

Joel Friedman

Andreas Goerdt

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

A Remark on Random 2-SAT.

[BibT_eX]

[DOI]

Andreas Goerdt

Discret. Appl. Math., 1999

1997

The Giant Component Threshold for Random Regular Graphs with Edge Faults.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

A Threshold for Unsatisfiability.

[BibT_eX]

[DOI]

Andreas Goerdt

J. Comput. Syst. Sci., 1996

1993

Regular Resolution Versus Unrestricted Resolution.

[BibT_eX]

[DOI]

Andreas Goerdt

SIAM J. Comput., 1993

On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search.

[BibT_eX]

[DOI]

Andreas Goerdt

Udo Kamps

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Characterizing Complexity Classes by General Recursive Definitions in Higher Types

[BibT_eX]

[DOI]

Andreas Goerdt

Inf. Comput., December, 1992

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions.

[BibT_eX]

[DOI]

Andreas Goerdt

Theor. Comput. Sci., 1992

Unrestricted Resolution versus N-Resolution.

[BibT_eX]

[DOI]

Andreas Goerdt

Theor. Comput. Sci., 1992

Davis-Putnam Resolution versus Unrestricted Resolution.

[BibT_eX]

[DOI]

Andreas Goerdt

Ann. Math. Artif. Intell., 1992

1991

The Cutting Plane Proof System with Bounded Degree of Falsity.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

Comparing the Complexity of Regular and Unrestricted Resolution.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the GWAI-90, 1990

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.

[BibT_eX]

[DOI]

Andreas Goerdt

Helmut Seidl

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Cuting Plane Versus Frege Proof Systems.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1988

Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

On the Expressive Strength of the Finitely Typed Lambda-Terms.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages

[BibT_eX]

Andreas Goerdt

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986

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

[BibT_eX]

[DOI]

Andreas Goerdt

PhD thesis, 1986

An Automata-Theoretical Characterization of the OI-Hierarchy

[BibT_eX]

[DOI]

Werner Damm

Andreas Goerdt

Inf. Control., 1986

1985

A Hoare Calculus for Functions Defined by Recursion on Higher Types.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Logics of Programs, 1985

1982

An Automata-Theoretic Characterization of the OI-Hierarchy.

[BibT_eX]

[DOI]

Werner Damm

Andreas Goerdt

Proceedings of the Automata, 1982

Andreas Goerdt

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...