The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Goerdt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amin Coja-Oghlan, Andreas Goerdt, André Lanka
    Strong Refutation Heuristics for Random k-SAT. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:310-321 [Conf]
  2. Andreas Goerdt
    Characterizing Complexity Classes by General Recursive Definitions in Higher Types. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:99-117 [Conf]
  3. Andreas Goerdt
    Davis-Putnam Resolution versus Unrestricted Resolution. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:143-162 [Conf]
  4. Andreas Goerdt
    Cuting Plane Versus Frege Proof Systems. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:174-194 [Conf]
  5. Andreas Goerdt
    The Cutting Plane Proof System with Bounded Degree of Falsity. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:119-133 [Conf]
  6. Andreas Goerdt, Udo Kamps
    On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:106-127 [Conf]
  7. Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
    Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:15-26 [Conf]
  8. Werner Damm, Andreas Goerdt
    An Automata-Theoretic Characterization of the OI-Hierarchy. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:141-153 [Conf]
  9. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
    Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:236-247 [Conf]
  10. Joel Friedman, Andreas Goerdt
    Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:310-321 [Conf]
  11. Andreas Goerdt, Helmut Seidl
    Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:148-158 [Conf]
  12. Andreas Goerdt
    Random Regular Graphs with Edge Faults: Expansion through Cores. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:219-228 [Conf]
  13. Andreas Goerdt, André Lanka
    On the Hardness and Easiness of Random 4-SAT Formulas. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:470-483 [Conf]
  14. Andreas Goerdt
    Comparing the Complexity of Regular and Unrestricted Resolution. [Citation Graph (0, 0)][DBLP]
    GWAI, 1990, pp:181-185 [Conf]
  15. Andreas Goerdt, Michael Molloy
    Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:38-47 [Conf]
  16. Andreas Goerdt
    Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:293-299 [Conf]
  17. Andreas Goerdt
    Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:364-374 [Conf]
  18. Andreas Goerdt
    A Hoare Calculus for Functions Defined by Recursion on Higher Types. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:106-117 [Conf]
  19. Andreas Goerdt
    On the Expressive Strength of the Finitely Typed Lambda-Terms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:318-328 [Conf]
  20. Andreas Goerdt
    Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:329-338 [Conf]
  21. Andreas Goerdt
    Unrestricted Resolution versus N-Resolution. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:300-305 [Conf]
  22. Andreas Goerdt
    A Threshold for Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:264-274 [Conf]
  23. Andreas Goerdt
    The Giant Component Threshold for Random Regular Graphs with Edge Faults. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:279-288 [Conf]
  24. Andreas Goerdt, Tomasz Jurdzinski
    Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:280-291 [Conf]
  25. Andreas Goerdt, Michael Krivelevich
    Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:294-304 [Conf]
  26. Andreas Goerdt
    Davis-Putnam Resolution versus Unrestricted Resolution. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:6, n:1-3, pp:169-184 [Journal]
  27. Andreas Goerdt, Tomasz Jurdzinski
    Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  28. Andreas Goerdt
    A Remark on Random 2-SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:107-110 [Journal]
  29. Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
    Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:030, pp:- [Journal]
  30. André Lanka, Andreas Goerdt
    An approximation hardness result for bipartite Clique [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:048, pp:- [Journal]
  31. Werner Damm, Andreas Goerdt
    An Automata-Theoretical Characterization of the OI-Hierarchy [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:71, n:1/2, pp:1-32 [Journal]
  32. Andreas Goerdt
    Characterizing Complexity Classes by General Recursive Definitions in Higher Types [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:2, pp:202-218 [Journal]
  33. Andreas Goerdt
    A Threshold for Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:469-486 [Journal]
  34. Joel Friedman, Andreas Goerdt, Michael Krivelevich
    Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:408-430 [Journal]
  35. Andreas Goerdt
    Regular Resolution Versus Unrestricted Resolution. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:661-683 [Journal]
  36. Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
    Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:1-45 [Journal]
  37. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal]
  38. Andreas Goerdt
    The giant component threshold for random regular graphs with edge faults H. Prodinger. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:307-321 [Journal]
  39. Andreas Goerdt
    Random regular graphs with edge faults: Expansion through cores. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:1, pp:91-125 [Journal]
  40. Andreas Goerdt
    Unrestricted Resolution versus N-Resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:93, n:1, pp:159-167 [Journal]
  41. Andreas Goerdt
    Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:45-66 [Journal]
  42. Andreas Goerdt, Michael Molloy
    Analysis of edge deletion processes on faulty random regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:241-260 [Journal]

  43. On Random Ordering Constraints. [Citation Graph (, )][DBLP]


  44. On Random Betweenness Constraints. [Citation Graph (, )][DBLP]


  45. Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP]


  46. Spectral Partitioning of Random Graphs with Given Expected Degrees. [Citation Graph (, )][DBLP]


  47. Tight Thresholds for Cuckoo Hashing via XORSAT [Citation Graph (, )][DBLP]


  48. Strong Refutation Heuristics for Random k-SAT. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002