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="Mou, Z. George"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recursive individually distributed object
Z. George Mou
Lecture Notes in Computer Science
1586
, 1999, pp. 63-78
Spectrum analysis and min-cut transformation of communication networks in parallel computers
Z. George Mou
Proceedings of the 5th Symposium on the Frontiers of Massively Parallel Computation, FRONTIERS'95 (McLean, Virginia, February 6-9, 1995)
, 1995, pp. 298-307
Optimal mappings of
m
dimensional FFT communication to
k
dimensional mesh for arbitrary
m
and
k
Z. George Mou
,
Xiaojing Wang
Lecture Notes in Computer Science
694
, 1993, pp. 104-119
Parallel partition expansion for the solution of arbitrary recurrences
A.J. Huang
,
Z. George Mou
Proceedings of the 1992 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'92 (University of Michigan, Michigan, August 17-21, 1992)
, 1992, pp. 109-113
DC transpose: A method for reducing communication in divide-and-conquer algorithms on mesh-based computers
Marc Goodman
,
Z. George Mou
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 218-221
A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers
Xiaojing Wang
,
Z. George Mou
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 810-817