Andreas Goerdt

54 papers A* 5A 1B 16Misc 3Journal 22Unranked 6

Year	Rank	Type	Title / Venue / Authors
2019	Misc	`conf`	Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. CSR Andreas Goerdt
2012	Misc	`conf`	Satisfiability Thresholds beyond k -XORSAT. CSR Andreas Goerdt, Lutz Falke
2011	J	`jnl`	Satisfiability thresholds beyond k-XORSAT CoRR Andreas Goerdt, Lutz Falke
2010	J	`jnl`	On Random Betweenness Constraints. Comb. Probab. Comput. Andreas Goerdt
2010	—	`conf`	Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
2009	B	`conf`	On Random Betweenness Constraints. FCT Andreas Goerdt
2009	Misc	`conf`	On Random Ordering Constraints. CSR Andreas Goerdt
2009	J	`jnl`	Tight Thresholds for Cuckoo Hashing via XORSAT CoRR Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
2007	J	`jnl`	Strong Refutation Heuristics for Random k-SAT. Comb. Probab. Comput. Amin Coja-Oghlan, Andreas Goerdt, André Lanka
2006	—	`conf`	Spectral Partitioning of Random Graphs with Given Expected Degrees. IFIP TCS Amin Coja-Oghlan, Andreas Goerdt, André Lanka
2005	J	`jnl`	Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. Joel Friedman, Andreas Goerdt, Michael Krivelevich
2004	J	`jnl`	An approximation hardness result for bipartite Clique Electron. Colloquium Comput. Complex. André Lanka, Andreas Goerdt
2004	B	`conf`	On the Hardness and Easiness of Random 4-SAT Formulas. ISAAC Andreas Goerdt, André Lanka
2004	—	`conf`	Strong Refutation Heuristics for Random k-SAT. APPROX-RANDOM Amin Coja-Oghlan, Andreas Goerdt, André Lanka
2004	J	`jnl`	Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theor. Comput. Sci. Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
2003	J	`jnl`	Analysis of edge deletion processes on faulty random regular graphs. Theor. Comput. Sci. Andreas Goerdt, Michael Molloy
2003	B	`conf`	Certifying Unsatisfiability of Random 2 FCT Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
2003	J	`jnl`	Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques Electron. Colloquium Comput. Complex. Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich
2003	J	`jnl`	Recognizing more random unsatisfiable 3-SAT instances efficiently. Electron. Notes Discret. Math. Andreas Goerdt, André Lanka
2003	J	`jnl`	Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. Comb. Probab. Comput. Andreas Goerdt, Tomasz Jurdzinski
2002	J	`jnl`	A deterministic (2-2/(k+1)) Theor. Comput. Sci. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
2002	B	`conf`	Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. MFCS Andreas Goerdt, Tomasz Jurdzinski
2001	A	`conf`	Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. STACS Andreas Goerdt, Michael Krivelevich
2001	J	`jnl`	Random regular graphs with edge faults: Expansion through cores. Theor. Comput. Sci. Andreas Goerdt
2001	A*	`conf`	Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. ICALP Joel Friedman, Andreas Goerdt
2001	J	`jnl`	The giant component threshold for random regular graphs with edge faults H. Prodinger. Theor. Comput. Sci. Andreas Goerdt
2000	B	`conf`	Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN Andreas Goerdt, Michael Molloy
2000	A*	`conf`	Deterministic Algorithms for ICALP Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
1999	J	`jnl`	A Remark on Random 2-SAT. Discret. Appl. Math. Andreas Goerdt
1998	B	`conf`	Random Regular Graphs with Edge Faults: Expansion through Cores. ISAAC Andreas Goerdt
1997	B	`conf`	The Giant Component Threshold for Random Regular Graphs with Edge Faults. MFCS Andreas Goerdt
1996	J	`jnl`	A Threshold for Unsatisfiability. J. Comput. Syst. Sci. Andreas Goerdt
1993	B	`conf`	On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search. CSL Andreas Goerdt, Udo Kamps
1993	J	`jnl`	Regular Resolution Versus Unrestricted Resolution. SIAM J. Comput. Andreas Goerdt
1992	B	`conf`	A Threshold for Unsatisfiability. MFCS Andreas Goerdt
1992	J	`jnl`	Characterizing Complexity Classes by General Recursive Definitions in Higher Types Inf. Comput. Andreas Goerdt
1992	J	`jnl`	Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. Theor. Comput. Sci. Andreas Goerdt
1992	J	`jnl`	Davis-Putnam Resolution versus Unrestricted Resolution. Ann. Math. Artif. Intell. Andreas Goerdt
1992	J	`jnl`	Unrestricted Resolution versus N-Resolution. Theor. Comput. Sci. Andreas Goerdt
1991	B	`conf`	The Cutting Plane Proof System with Bounded Degree of Falsity. CSL Andreas Goerdt
1990	—	`conf`	Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS Andreas Goerdt, Helmut Seidl
1990	—	`conf`	Comparing the Complexity of Regular and Unrestricted Resolution. GWAI Andreas Goerdt
1990	B	`conf`	Cuting Plane Versus Frege Proof Systems. CSL Andreas Goerdt
1990	B	`conf`	Unrestricted Resolution versus N-Resolution. MFCS Andreas Goerdt
1989	A*	`conf`	Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions LICS Andreas Goerdt
1989	B	`conf`	Davis-Putnam Resolution versus Unrestricted Resolution. CSL Andreas Goerdt
1988	B	`conf`	Characterizing Complexity Classes by General Recursive Definitions in Higher Types. CSL Andreas Goerdt
1988	B	`conf`	Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. MFCS Andreas Goerdt
1988	B	`conf`	On the Expressive Strength of the Finitely Typed Lambda-Terms. MFCS Andreas Goerdt
1987	A*	`conf`	Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages LICS Andreas Goerdt
1986	J	`jnl`	An Automata-Theoretical Characterization of the OI-Hierarchy Inf. Control. Werner Damm, Andreas Goerdt
1986	—	`—`	Ein Hoare Kalkül für die Sprache der getypten Lambda-Terme: Korrektheit, Vollständigkeit, Anwendungen. Andreas Goerdt
1985	—	`conf`	A Hoare Calculus for Functions Defined by Recursion on Higher Types. Logic of Programs Andreas Goerdt
1982	A*	`conf`	An Automata-Theoretic Characterization of the OI-Hierarchy. ICALP Werner Damm, Andreas Goerdt