Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andreas Goerdt
2010 – today
- 2012
[c30]- 2011
- [i4]
- 2010
- [j18]Andreas Goerdt: On Random Betweenness Constraints. Combinatorics, Probability & Computing 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]
- [c27]
- [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. Combinatorics, Probability & Computing 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. Electronic Colloquium on Computational Complexity (ECCC)(048) (2004)
- 2003
- [j14]Andreas Goerdt, Tomasz Jurdzinski: Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. Combinatorics, Probability & Computing 12(3): 245-267 (2003)
- [j13]Andreas Goerdt, André Lanka: Recognizing more random unsatisfiable 3-SAT instances efficiently. Electronic Notes in Discrete Mathematics 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. Electronic Colloquium on Computational Complexity (ECCC) 10(030) (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]
- 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]
- 1993
- [j6]Andreas Goerdt: Regular Resolution Versus Unrestricted Resolution. SIAM J. Comput. 22(4): 661-683 (1993)
- [c15]
- 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]
- 1991
- [c13]
- 1990
- [c12]
- [c11]Andreas Goerdt, Helmut Seidl: Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990: 148-158
- [c10]
- [c9]
1980 – 1989
- 1989
- [c8]
- [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]
- [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
- [j1]Werner Damm, Andreas Goerdt: An Automata-Theoretical Characterization of the OI-Hierarchy. Information and 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:32 CET by the dblp team