Andreas Goerdt - Concepedia

Author

Andreas Goerdt

Chemnitz University of Technology

Also Known As

A. Goerdt, ANDREAS GOERDT, Andreas Goerdt, Goerdt, Andreas

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

Chemnitz University of Technology Humboldt-Universität zu Berlin University of Duisburg-Essen

About

Andreas Goerdt is an author at Chemnitz University of Technology specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	13	778
2	Computer Science	8	8	653
3	Combinatorial Optimization	4	4	294
4	Education	2	2	36
5	Complexity	2	2	43

Andreas Goerdt

Publications

886

Citations

H-Index

Page 1

	Year	Citations
A Threshold for Unsatisfiability Andreas Goerdt Journal of Computer and System Sciences EngineeringAutomated ReasoningProof ComplexityVerificationSat Solving	1996	238
A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search Evgeny Dantsin, Andreas Goerdt, Edward Hirsch, Theoretical Computer Science Local SearchEngineeringLocal Search (Optimization)Data MiningAlgorithm Design	2002	227
An automata-theoretical characterization of the OI-hierarchy Werner Damm, Andreas Goerdt Information and Control Logical AutomatonEngineeringAutomated ReasoningFormal MethodsAutomaton Network	1986	69
Davis-Putnam resolution versus unrestricted resolution Andreas Goerdt Annals of Mathematics and Artificial Intelligence EngineeringAutomated ReasoningProof ComplexityComputational ComplexitySatisfiability	1992	49
Regular Resolution Versus Unrestricted Resolution Andreas Goerdt SIAM Journal on Computing High ResolutionEngineeringAutomated ReasoningPropositional LogicProof Complexity	1993	33
Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently Joel Friedman, Andreas Goerdt, Michael Krivelevich SIAM Journal on Computing Computational Complexity TheoryEngineeringOdd KApproximation TheoryAutomated Reasoning	2005	32
Strong Refutation Heuristics for Random <i>k</i>-SAT Amin Coja‐Oghlan, Andreas Goerdt, André Lanka Combinatorics Probability Computing	2006	28
Characterizing complexity classes by higher type primitive recursive definitions Andreas Goerdt Theoretical Computer Science EngineeringComplexity ClassesFormal MethodsComputational ComplexityComputer Science	1992	27
The giant component threshold for random regular graphs with edge faults H. Prodinger Andreas Goerdt Theoretical Computer Science Graph SparsityReliability EngineeringGraph TheoryRandom GraphProbabilistic Graph Theory	2001	24
Techniques from combinatorial approximation algorithms yield efficient algorithms for random<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:mi>k</mml:mi></mml:math>-SAT Amin Coja‐Oghlan, Andreas Goerdt, André Lanka, Theoretical Computer Science Math XmlnsEngineeringAlgorithm DesignCombinatorial ProblemAnalysis Of Algorithm	2004	23

Page 1