Travelled to:1 × Denmark
1 × France
1 × Greece
1 × United Kingdom
2 × Switzerland
2 × USA
3 × Germany
Collaborated with:∅ J.Friedman U.Kamps W.Damm E.Dantsin E.A.Hirsch U.Schöning M.Dietzfelbinger M.Mitzenmacher A.Montanari R.Pagh M.Rink
Talks about:character (3) resolut (2) definit (2) complex (2) versus (2) system (2) search (2) recurs (2) higher (2) proof (2)
Person: Andreas Goerdt
DBLP: Goerdt:Andreas
Contributed to:
201020012000
1993199119901989
1989198819871982Wrote 11 papers:
- ICALP-v1-2010-DietzfelbingerGMMPR #satisfiability
- Tight Thresholds for Cuckoo Hashing via XORSAT (MD, AG, MM, AM, RP, MR), pp. 213–225.
- ICALP-2001-FriedmanG #random #satisfiability
- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently (JF, AG), pp. 310–321.
- ICALP-2000-DantsinGHS #algorithm #satisfiability
- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.
- CSL-1993-GoerdtK #backtracking #on the #parallel
- On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search (AG, UK), pp. 106–127.
- CSL-1991-Goerdt #bound #proving
- The Cutting Plane Proof System with Bounded Degree of Falsity (AG), pp. 119–133.
- CSL-1990-Goerdt #proving
- Cuting Plane Versus Frege Proof Systems (AG), pp. 174–194.
- CSL-1989-Goerdt #strict
- Davis-Putnam Resolution versus Unrestricted Resolution (AG), pp. 143–162.
- LICS-1989-Goerdt #complexity #recursion
- Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.
- CSL-1988-Goerdt #complexity #recursion
- Characterizing Complexity Classes by General Recursive Definitions in Higher Types (AG), pp. 99–117.
- LICS-1987-Goerdt #hoare #imperative #logic
- Hoare Logic for λ-Terms as Basis of Hoare Logic for Imperative Languages (AG), pp. 293–299.
- ICALP-1982-DammG
- An Automata-Theoretic Characterization of the OI-Hierarchy (WD, AG), pp. 141–153.