Andreas Goerdt

According to our database1, Andreas Goerdt authored at least 44 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions.
Proceedings of the Computer Science - Theory and Applications, 2019

2012
Satisfiability Thresholds beyond k -XORSAT.
Proceedings of the Computer Science - Theory and Applications, 2012

2010
Tight Thresholds for Cuckoo Hashing via XORSAT.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
On Random Betweenness Constraints.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

On Random Ordering Constraints.
Proceedings of the Computer Science, 2009

2006
Spectral Partitioning of Random Graphs with Given Expected Degrees.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.
SIAM J. Comput., 2005

2004
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.
Theor. Comput. Sci., 2004

An approximation hardness result for bipartite Clique
Electronic Colloquium on Computational Complexity (ECCC), 2004

On the Hardness and Easiness of Random 4-SAT Formulas.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Strong Refutation Heuristics for Random k-SAT.
Proceedings of the Approximation, 2004

2003
Recognizing more random unsatisfiable 3-SAT instances efficiently.
Electronic Notes in Discrete Mathematics, 2003

Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques
Electronic Colloquium on Computational Complexity (ECCC), 2003

Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.
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.
Theor. Comput. Sci., 2002

Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
The giant component threshold for random regular graphs with edge faults H. Prodinger.
Theor. Comput. Sci., 2001

Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.
Proceedings of the STACS 2001, 2001

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
A Remark on Random 2-SAT.
Discrete Applied Mathematics, 1999

1998
Random Regular Graphs with Edge Faults: Expansion through Cores.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
The Giant Component Threshold for Random Regular Graphs with Edge Faults.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1993
Regular Resolution Versus Unrestricted Resolution.
SIAM J. Comput., 1993

On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search.
Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992
Characterizing Complexity Classes by General Recursive Definitions in Higher Types
Inf. Comput., December, 1992

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions.
Theor. Comput. Sci., 1992

A Threshold for Unsatisfiability.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
The Cutting Plane Proof System with Bounded Degree of Falsity.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
Unrestricted Resolution versus N-Resolution.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Comparing the Complexity of Regular and Unrestricted Resolution.
Proceedings of the GWAI-90, 1990

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Cuting Plane Versus Frege Proof Systems.
Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989
Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Davis-Putnam Resolution versus Unrestricted Resolution.
Proceedings of the CSL '89, 1989

1988
Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

On the Expressive Strength of the Finitely Typed Lambda-Terms.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Characterizing Complexity Classes by General Recursive Definitions in Higher Types.
Proceedings of the CSL '88, 1988

1987
Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages
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.
PhD thesis, 1986

An Automata-Theoretical Characterization of the OI-Hierarchy
Information and Control, 1986

1985
A Hoare Calculus for Functions Defined by Recursion on Higher Types.
Proceedings of the Logics of Programs, 1985

1982
An Automata-Theoretic Characterization of the OI-Hierarchy.
Proceedings of the Automata, 1982


  Loading...