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="Sieling, Detlef"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimization problems for parity OBDDs
Detlef Sieling
Theory of Computing Systems
44
(3), 2009, pp. 391-413
Minimization of decision trees is hard to approximate
Detlef Sieling
Journal of Computer and System Sciences
74
(3), 2008, pp. 394-403
Poker per E-Mail
Detlef Sieling
eXamen.press
, 2008, pp. 181-192
Quantum branching programs and space-bounded nonuniform quantum complexity
Martin Sauerhoff
,
Detlef Sieling
Theoretical Computer Science
334
(1-3), 2005, pp. 177-225
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Petr Savický
,
Detlef Sieling
Theoretical Computer Science
340
(3), 2005, pp. 594-605
The nonapproximability of OBDD minimization
Detlef Sieling
Information and Computation
172
(2), 2002, pp. 103-138
Lower bounds for linearly transformed OBDDs and FBDDs
Detlef Sieling
Journal of Computer and System Sciences
64
(2), 2002, pp. 419-438
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Petr Savický
,
Detlef Sieling
Lecture Notes in Computer Science
1893
, 2000, pp. 650-659
Restricted branching programs with parity-type augmentations - Lower bonds and algorithms
Detlef Sieling
Proceedings in Informatics
8
, 2000, pp. 259-262
The complexity of minimizing FBDDs
Detlef Sieling
Lecture Notes in Computer Science
1672
, 1999, pp. 251-261
Lower bounds for linear transformed OBDDs and FBDDs
Detlef Sieling
Lecture Notes in Computer Science
1738
, 1999, pp. 356-368
Hierarchy theorems for
k
OBDDs and
k
IBDDs
Beate Bollig
,
Martin Sauerhoff
,
Detlef Sieling
,
Ingo Wegener
Theoretical Computer Science
205
(1-2), 1998, pp. 45-60
Parity OBDDs cannot be handled efficiently enough
Martin Löbbing
,
Detlef Sieling
,
Ingo Wegener
Information Processing Letters
67
(4), 1998, pp. 163-168
Derandomization
Detlef Sieling
Lecture Notes in Computer Science
1367
, 1998, pp. 41-61
On the existence of polynomial time approximation schemes for OBDD minimization
Detlef Sieling
Lecture Notes in Computer Science
1373
, 1998, pp. 205-215
New lower bounds and hierarchy results for restricted branching programs
Detlef Sieling
Journal of Computer and System Sciences
53
(1), 1996, pp. 79-87
New lower bounds and hierarchy results for restricted branching programs
Detlef Sieling
,
Ingo Wegener
Lecture Notes in Computer Science
903
, 1995, pp. 359-370
Graph driven BDDs - a new data structure for Boolean functions
Detlef Sieling
,
Ingo Wegener
Theoretical Computer Science
141
(1-2), 1995, pp. 283-310
Reduction of OBDDs in linear time
Detlef Sieling
,
Ingo Wegener
Information Processing Letters
48
(3), 1993, pp. 139-144
NC
-algorithms for operations on binary decision diagrams
Detlef Sieling
,
Ingo Wegener
Parallel Processing Letters
3
(1), 1993, pp. 3-12