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
[1]
Hilfe
Suche: Author="Nickelsen, Arfst"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
One query reducibilities between partial information classes
Sebastian Bab
,
Arfst Nickelsen
Theoretical Computer Science
345
(2-3), 2005, pp. 173-189
Combining self-reducibility and partial information algorithms
André Hernich
,
Arfst Nickelsen
Lecture Notes in Computer Science
3618
, 2005, pp. 483-494
The complexity of finding paths in graphs with bounded independence number
Arfst Nickelsen
,
Till Tantau
SIAM Journal on Computing
34
(5), 2005, pp. 1176-1195
One query reducibilities between partial information classes
Sebastian Bab
,
Arfst Nickelsen
Lecture Notes in Computer Science
3153
, 2004, pp. 404-415
Algebraic properties for selector functions
Lane A. Hemaspaandra
,
Harald Hempel
,
Arfst Nickelsen
SIAM Journal on Computing
33
(6), 2004, pp. 1309-1337
On reachability in graphs with bounded independence number
Arfst Nickelsen
,
Till Tantau
Lecture Notes in Computer Science
2387
, 2002, pp. 554-563
Algebraic properties for
P
-selectivity
Lane A. Hemaspaandra
,
Harald Hempel
,
Arfst Nickelsen
Lecture Notes in Computer Science
2108
, 2001, pp. 49-58
Partial information and special case algorithms
Arfst Nickelsen
Lecture Notes in Computer Science
2136
, 2001, pp. 573-584
On polynomially
D
-verbose sets
Arfst Nickelsen
Lecture Notes in Computer Science
1200
, 1997, pp. 307-318
Deciding verbose languages with linear advice
Arfst Nickelsen
Lecture Notes in Computer Science
1295
, 1997, pp. 438-447
Counting, selecting, and sorting by query-bounded machines
Albrecht Hoene
,
Arfst Nickelsen
Lecture Notes in Computer Science
665
, 1993, pp. 196-205
Counting, selecting, and sorting by query-bounded machines
Albrecht Hoene
,
Arfst Nickelsen
Technical Report (92-15), 1992, May