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="Klasing, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
J. Hromkovic̑
,
K. Loryś
,
P. Kanarek
,
R. Klasing
,
W. Unger
,
H. Wagener
Lecture Notes in Computer Science
900
, 1995, pp. 255-266
The relationship between gossiping in vertex-disjoint paths mode and bisection width
R. Klasing
Lecture Notes in Computer Science
841
, 1994, pp. 473-483
Parallel architectures: Design and efficient use
B. Monien
,
R. Feldmann
,
R. Klasing
,
R. Lüling
Lecture Notes in Computer Science
665
, 1993, pp. 247-269
Optimal embedding of complete binary trees into lines and grids
R. Heckmann
,
R. Klasing
,
B. Monien
,
W. Unger
Lecture Notes in Computer Science
570
, 1992, pp. 25-35
Broadcasting in butterfly and deBruijn networks
R. Klasing
,
B. Monien
,
R. Peine
,
E. Stöhr
Lecture Notes in Computer Science
577
, 1992, pp. 351-362
Optimal embeddings of complete binary trees into lines and grids
R. Heckmann
,
R. Klasing
,
B. Monien
,
W. Unger
misc, 1991
Compressing cube-connected cycles and butterfly networks
R. Klasing
,
R. Lüling
,
B. Monien
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 858-865