Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Goerdt, Andreas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Satisfiability thresholds beyond
k
-XORSAT
Andreas Goerdt
,
Lutz Falke
Lecture Notes in Computer Science
7353
, 2012, pp. 148-159
Tight thresholds for cuckoo hashing via XORSAT
Martin Dietzfelbinger
,
Andreas Goerdt
,
Michael Mitzenmacher
,
Andrea Montanari
,
Rasmus Pagh
,
Michael Rink
Lecture Notes in Computer Science
6198
, 2010, pp. 213-225
Recognizing more unsatisfiable random
k
-SAT instances efficiently
Joel Friedman
,
Andreas Goerdt
,
Michael Krivelevich
SIAM Journal on Computing
35
(2), 2005, pp. 408-430
Techniques from combinatorial approximation algorithms yield efficient algorithms for random
2k
-SAT
Amin Coja-Oghlan
,
Andreas Goerdt
,
André Lanka
,
Frank Schädlich
Theoretical Computer Science
329
(1-3), 2004, pp. 1-45
On the hardness and easiness of random 4-SAT formulas
Andreas Goerdt
,
André Lanka
Lecture Notes in Computer Science
3341
, 2004, pp. 470-483
Analysis of edge deletion processes on faulty random regular graphs
Andreas Goerdt
,
Mike Molloy
Theoretical Computer Science
297
(1-3), 2003, pp. 241-260
A deterministic
(2-2/(k+1))^n
algorithm for
k
-SAT based on local search
Evgeny Dantsin
,
Andreas Goerdt
,
Edward A. Hirsch
,
Ravi Kannan
,
Jon Kleinberg
,
Christos Papadimitriou
,
Prabhakar Raghavan
,
Uwe Schöning
Theoretical Computer Science
289
(1), 2002, pp. 69-83
Some results on random unsatisfiable
k
-sat instances and approximation algorithms applied to random structures
Andreas Goerdt
,
Tomasz Jurdziński
Lecture Notes in Computer Science
2420
, 2002, pp. 280-291
Recognizing more unsatisfiable random 3-SAT instances efficiently
Joel Friedman
,
Andreas Goerdt
Lecture Notes in Computer Science
2076
, 2001, pp. 310-321
Efficient recognition of random unsatisfiable
k
-SAT instances by spectral methods
Andreas Goerdt
,
Michael Krivelevich
Lecture Notes in Computer Science
2010
, 2001, pp. 294-304
The giant component threshold for random regular graphs with edge faults
Andreas Goerdt
Theoretical Computer Science
259
(1-2), 2001, pp. 307-321
Random regular graphs with edge faults: Expansion through cores
Andreas Goerdt
Theoretical Computer Science
264
(1), 2001, pp. 91-125
Deterministic algorithms for
k
-SAT based on covering codes and local search
Evgeny Dantsin
,
Andreas Goerdt
,
Edward A. Hirsch
,
Uwe Schöning
Lecture Notes in Computer Science
1853
, 2000, pp. 236-247
A remark on random 2-SAT
Andreas Goerdt
Discrete Applied Mathematics
96-97
, 1999, pp. 107-110
Random regular graphs with edge faults: Expansion through cores
Andreas Goerdt
Lecture Notes in Computer Science
1533
, 1998, pp. 219-228
The giant component threshold for random regular graphs with edge faults
Andreas Goerdt
Lecture Notes in Computer Science
1295
, 1997, pp. 279-288
A threshold for unsatisfiability
Andreas Goerdt
Journal of Computer and System Sciences
53
(3), 1996, pp. 469-486
Regular resolution versus unrestricted resolution
Andreas Goerdt
SIAM Journal on Computing
22
(4), 1993, August, pp. 661-683
Characterizing complexity classes by general recursive dfinitions in higher types
Andreas Goerdt
Information and Computation
101
(2), 1992, December, pp. 202-218
Unrestricted resolution versus N-resolution
Andreas Goerdt
Theoretical Computer Science
93
, 1992, pp. 159-167
Charaterizing complexity classes by higher type primitive recursive definitions
Andreas Goerdt
Theoretical Computer Science
100
, 1992, pp. 45-66
A threshold for unsatisfiability
Andreas Goerdt
Lecture Notes in Computer Science
629
, 1992, pp. 264-274