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: Journal=J. Parallel Distrib.~Comput. AND Volume=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A function-composition approach to synthesize Fortran 90 array operations
Gwan-Hwan Hwang
,
Jenq Kuen Lee
,
Roy Dz-Ching Ju
Journal Parallel Distributed Computing
54
(1), 1998, pp. 1-47
A novel approach to fast discrete Fourier transform
J.G. Liu
,
H.F. Li
,
F.H.Y. Chan
,
F.K. Lam
Journal Parallel Distributed Computing
54
(1), 1998, pp. 48-58
Embedding of binomial trees in hypercubes with link faults
Jie Wu
,
Eduardo B. Fernandez
,
Yingqiu Luo
Journal Parallel Distributed Computing
54
(1), 1998, pp. 59-74
Packet routing in fixed-connection networks: A survey
Miltos D. Grammatikakis
,
D. Frank Hsu
,
Miro Kraetzl
,
Jop F. Sibeyn
Journal Parallel Distributed Computing
54
(2), 1998, pp. 77-132
Average case analysis of searching in associative processing
Panagiotis E. Nastou
,
Dimitrios N. Serpanos
,
Dimitrios G. Maritsas
Journal Parallel Distributed Computing
54
(2), 1998, pp. 133-161
Routing permutations on graphs via factors
Dominique Barth
,
Petris̀§or Panaite
Journal Parallel Distributed Computing
54
(2), 1998, pp. 162-182
Gallop: The benefits of wide-area computing for parallel processing
Jon B. Weissman
Journal Parallel Distributed Computing
54
(2), 1998, pp. 183-205
The new class of
g
-chain periodic sorters
Ronald I. Becker
,
David Nassimi
,
Yehoshua Perl
Journal Parallel Distributed Computing
54
(2), 1998, pp. 206-222