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
[2]
Hilfe
Suche: Author="Meinel, Ch."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Ch. Meinel
,
A. Slobodová
Theory of Computing Systems
30
(5), 1997, pp. 495-518
On the complexity of constructing optimal ordered binary decision diagrams
Ch. Meinel
,
A. Slobodova
Lecture Notes in Computer Science
841
, 1994, pp. 515-524
Analysis and manipulation of Boolean functions in terms of decision graphs
J. Gergov
,
Ch. Meinel
Technical Report (92-07), 1992
Efficient analysis and manipulation of OBDDs can be extended to read-once-only branching programs
J. Gergov
,
Ch. Meinel
Technical Report (92-10), 1992
Upper and lower bounds for certain graph-accessibility-problems on bounded alternating
\omega
-branching programs
Ch. Meinel
,
S. Waack
Technical Report (92-04), 1992
A note on Möbius functions and the communication complexity of the graph-accessibility-problem
Ch. Meinel
Technical Report (92-05), 1992
Restricted branching programs and their computational power
Ch. Meinel
Lecture Notes in Computer Science
452
, 1990, pp. 61-75
Separating completely complexity classes related to polynomial size
\Omega
-decision trees
C. Damm
,
Ch. Meinel
Lecture Notes in Computer Science
380
, 1989, pp. 127-136
Switching graphs and their complexity
Ch. Meinel
Lecture Notes in Computer Science
379
, 1989, pp. 350-359
Separating the eraser Turing machine classes
L_e
,
NL_e
, co-
NL_e
and
P_e
M. Krause
,
Ch. Meinel
,
S. Waack
Lecture Notes in Computer Science
324
, 1988, pp. 405-413
Recursive design of communication schemes for parallel computation with R E L A C S
Ch. Meinel
,
P. Zienicke
Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, PARCELLA'88 (Berlin (GDR), October 17-21, 1988)
48
, 1988, pp. 308-310
The power of polynomial size
\Omega
-branching programs
Ch. Meinel
Lecture Notes in Computer Science
294
, 1988, pp. 81-90