default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Goerdt
Person information
- affiliation: Chemnitz University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c31]Andreas Goerdt:
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. CSR 2019: 156-167- 2012
- [c30]Andreas Goerdt, Lutz Falke:
Satisfiability Thresholds beyond k -XORSAT. CSR 2012: 148-159 - 2011
- [i4]Andreas Goerdt, Lutz Falke:
Satisfiability thresholds beyond k-XORSAT. CoRR abs/1112.2118 (2011) - 2010
- [j18]Andreas Goerdt:
On Random Betweenness Constraints. Comb. Probab. Comput. 19(5-6): 775-790 (2010) - [c29]Martin Dietzfelbinger
, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) 2010: 213-225
2000 – 2009
- 2009
- [c28]Andreas Goerdt:
On Random Ordering Constraints. CSR 2009: 105-116 - [c27]Andreas Goerdt:
On Random Betweenness Constraints. FCT 2009: 157-168 - [i3]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs/0912.0287 (2009) - 2007
- [j17]Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Strong Refutation Heuristics for Random k-SAT. Comb. Probab. Comput. 16(1): 5-28 (2007) - 2006
- [c26]Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Spectral Partitioning of Random Graphs with Given Expected Degrees. IFIP TCS 2006: 271-282 - 2005
- [j16]Joel Friedman, Andreas Goerdt, Michael Krivelevich:
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005) - 2004
- [j15]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): 1-45 (2004) - [c25]Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Strong Refutation Heuristics for Random k-SAT. APPROX-RANDOM 2004: 310-321 - [c24]Andreas Goerdt, André Lanka:
On the Hardness and Easiness of Random 4-SAT Formulas. ISAAC 2004: 470-483 - [i2]André Lanka, Andreas Goerdt:
An approximation hardness result for bipartite Clique. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j14]Andreas Goerdt, Tomasz Jurdzinski:
Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. Comb. Probab. Comput. 12(3): 245-267 (2003) - [j13]Andreas Goerdt, André Lanka:
Recognizing more random unsatisfiable 3-SAT instances efficiently. Electron. Notes Discret. Math. 16: 21-46 (2003) - [j12]Andreas Goerdt, Michael Molloy:
Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. 297(1-3): 241-260 (2003) - [c23]Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26 - [i1]Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j11]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning:
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002) - [c22]Andreas Goerdt, Tomasz Jurdzinski:
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. MFCS 2002: 280-291 - 2001
- [j10]Andreas Goerdt:
The giant component threshold for random regular graphs with edge faults H. Prodinger. Theor. Comput. Sci. 259(1-2): 307-321 (2001) - [j9]Andreas Goerdt:
Random regular graphs with edge faults: Expansion through cores. Theor. Comput. Sci. 264(1): 91-125 (2001) - [c21]Joel Friedman, Andreas Goerdt:
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. ICALP 2001: 310-321 - [c20]Andreas Goerdt, Michael Krivelevich:
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. STACS 2001: 294-304 - 2000
- [c19]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning:
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. ICALP 2000: 236-247 - [c18]Andreas Goerdt, Michael Molloy:
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN 2000: 38-47
1990 – 1999
- 1999
- [j8]Andreas Goerdt:
A Remark on Random 2-SAT. Discret. Appl. Math. 96-97: 107-110 (1999) - 1998
- [c17]Andreas Goerdt:
Random Regular Graphs with Edge Faults: Expansion through Cores. ISAAC 1998: 219-228 - 1997
- [c16]Andreas Goerdt:
The Giant Component Threshold for Random Regular Graphs with Edge Faults. MFCS 1997: 279-288 - 1996
- [j7]Andreas Goerdt:
A Threshold for Unsatisfiability. J. Comput. Syst. Sci. 53(3): 469-486 (1996) - 1993
- [j6]Andreas Goerdt:
Regular Resolution Versus Unrestricted Resolution. SIAM J. Comput. 22(4): 661-683 (1993) - [c15]Andreas Goerdt, Udo Kamps:
On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. CSL 1993: 106-127 - 1992
- [j5]Andreas Goerdt:
Davis-Putnam Resolution versus Unrestricted Resolution. Ann. Math. Artif. Intell. 6(1-3): 169-184 (1992) - [j4]Andreas Goerdt:
Characterizing Complexity Classes by General Recursive Definitions in Higher Types. Inf. Comput. 101(2): 202-218 (1992) - [j3]Andreas Goerdt:
Unrestricted Resolution versus N-Resolution. Theor. Comput. Sci. 93(1): 159-167 (1992) - [j2]Andreas Goerdt:
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. Theor. Comput. Sci. 100(1): 45-66 (1992) - [c14]Andreas Goerdt:
A Threshold for Unsatisfiability. MFCS 1992: 264-274 - 1991
- [c13]Andreas Goerdt:
The Cutting Plane Proof System with Bounded Degree of Falsity. CSL 1991: 119-133 - 1990
- [c12]Andreas Goerdt:
Cuting Plane Versus Frege Proof Systems. CSL 1990: 174-194 - [c11]Andreas Goerdt, Helmut Seidl:
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990: 148-158 - [c10]Andreas Goerdt:
Comparing the Complexity of Regular and Unrestricted Resolution. GWAI 1990: 181-185 - [c9]Andreas Goerdt:
Unrestricted Resolution versus N-Resolution. MFCS 1990: 300-305
1980 – 1989
- 1989
- [c8]Andreas Goerdt:
Davis-Putnam Resolution versus Unrestricted Resolution. CSL 1989: 143-162 - [c7]Andreas Goerdt:
Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions. LICS 1989: 364-374 - 1988
- [c6]Andreas Goerdt:
Characterizing Complexity Classes by General Recursive Definitions in Higher Types. CSL 1988: 99-117 - [c5]Andreas Goerdt:
On the Expressive Strength of the Finitely Typed Lambda-Terms. MFCS 1988: 318-328 - [c4]Andreas Goerdt:
Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. MFCS 1988: 329-338 - 1987
- [c3]Andreas Goerdt:
Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages. LICS 1987: 293-299 - 1986
- [b1]Andreas Goerdt:
Ein Hoare Kalkül für die Sprache der getypten Lambda-Terme: Korrektheit, Vollständigkeit, Anwendungen. RWTH Aachen University, Germany, 1986, pp. 1-268 - [j1]Werner Damm, Andreas Goerdt:
An Automata-Theoretical Characterization of the OI-Hierarchy. Inf. Control. 71(1/2): 1-32 (1986) - 1985
- [c2]Andreas Goerdt:
A Hoare Calculus for Functions Defined by Recursion on Higher Types. Logic of Programs 1985: 106-117 - 1982
- [c1]Werner Damm, Andreas Goerdt:
An Automata-Theoretic Characterization of the OI-Hierarchy. ICALP 1982: 141-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
